A construction of \(V_{h}\)-sequences and its application to binary asymmetric error-correcting codes (Q1633301): Difference between revisions

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.