A construction of V_h-sequences and its application to binary asymmetric error-correcting codes
Given a finite abelian group \(G\) a sequence of elements on it \(g_1,\ldots,g_n\) is called a \(V_h\)-sequence if all \[ g_{i_1}+g_{i_2}+\cdots+g_{i_j}, \;\;1\leq j\leq h, 1\leq i_1\leq i_2\leq\cdots\leq i_j\leq n \] are pairwaise distinct. A well known technique is to use \(V_h\)-sequences to construct Asymmetric Error Correcting Codes (AECC), these are codes over asymmetric channels, i.e., channels where not every symbol error is equally probable. For example the binary asymmetric channel sends 0 to 0 with probability 1 and 1 to 0 with probability \(p\). As in the symmetric case is of interest to find a lower bound for \(\Gamma_q(n,d)\), the maximum number of codewords in a \(q\)-ary code of length \(n\) and minimum distance \(d\). The authors construct \(V_h\) sequences via algebraic function fields, more precisely, they find conditions under which a sequence of rational points is a \(V_{d-1}\) sequences in the ray class group. Moreover they provide explicit lower bound for \(\Gamma_q(n,d)\) in concrete families of function fields: Rational function fields, Elliptic function fields, function fields of genus 2, Hermitian function fields. Point out that their method works over any characteristics and in the particular case of the binary case the lower bounds for \(\Gamma_2(n,d)\) improve the existing ones.
- Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
- On the construction of \(m\)-ary asymmetric error correcting codes with magnitude error criterion
- Bounds and constructions of asymmetric or unidirectional error-correcting codes
- Lower bounds and constructions for q-ary codes correcting asymmetric error
- Error-Correcting Codes and<tex>$B_h$</tex>-Sequences
- Constructions for binary codes correcting asymmetric errors from function fields
- New lower bounds and constructions for binary codes correcting asymmetric errors
- On S_h-sequences of binary vectors and linear codes
- On q-ary asymmetric error-correcting codes
- Constructions for variable-length error-correcting codes
- A class of codes for asymmetric channels and a problem from the additive theory of numbers
- A Construction of Binary Constant-Weight Codes From Algebraic Curves Over Finite Fields
- A low-rate bound for asymmetric error-correcting codes (Corresp.)
- A note on error detection codes for asymmetric channels
- A single asymmetric error-correcting code with 2/sup 13/ codewords of dimension 17
- Abelian varieties over finite fields
- Algebraic Cayley graphs over finite fields
- Algebraic function fields and codes
- An asymmetric error-correcting ternary code (Corresp.)
- Asymmetric/unidirectional error correcting and detecting codes
- Bounds and constructions for binary asymmetric error-correcting codes (Corresp.)
- Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6
- Bounds and constructions of asymmetric or unidirectional error-correcting codes
- Comments on "A class of codes for axisymmetric channels and a problem from the additive theory of numbers" by Varshanov, R. R.
- Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields
- Construction for binary asymmetric error-correcting codes (Corresp.)
- scientific article; zbMATH DE number 3855274 (Why is no real title available?)
- scientific article; zbMATH DE number 826043 (Why is no real title available?)
- scientific article; zbMATH DE number 877117 (Why is no real title available?)
- New lower bounds and constructions for binary codes correcting asymmetric errors
- New lower bounds for asymmetric and unidirectional codes
- New lower bounds for binary codes of asymmetric distance two
- New single asymmetric error-correcting codes
- New upper bounds on the size of codes correcting asymmetric errors (Corresp.)
- On group-theoretic codes for asymmetric channels
- On Robinson's coding problem (Corresp.)
- On systematic single asymmetric error-correcting codes
- On the theory of binary asymmetric error correcting codes
- Optimal asymmetric error detecting codes
- Optimal error detection codes for completely asymmetric binary channels
- Some new binary codes correcting asymmetric/unidirectional errors
- Spectral enumerators for certain additive-error-correcting codes over integer alphabets
- Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes
- The constantinrao construction for binary asymmetric error-correcting codes
- Theorems in the additive theory of numbers
- Upper bounds on codes correcting asymmetric errors (Corresp.)
This page was built for publication: A construction of \(V_{h}\)-sequences and its application to binary asymmetric error-correcting codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633301)
