Elliptic codes over fields of characteristic 2 (Q1088745): Difference between revisions

Let \({\mathbb{F}}_ q\) be the finite field with q elements, \(p=q^ a\) for some integer a, \({\bar {\mathbb{F}}}_ q\) the algebraic closure of \({\mathbb{F}}_ q\) and \(P_ n(K)\) the projective space of dimension \(n\) over K. The construction of a class of error correcting codes due to \textit{K. D. Goppa} [Math. USSR, Izv. 21, 75-91 (1983); translation from Izv. Akad. Nauk SSSR, Ser. Mat. 46, 762-781 (1982; Zbl 0522.94013)] involves choosing an algebraic \(curve\quad C\) contained in \(P_ r({\bar {\mathbb{F}}}_ q)\), defined over \({\mathbb{F}}_ q\), a set D of n points whose coordinates all lie in \({\mathbb{F}}_ q\), and a generator G, a family of points on C disjoint from D. From such a selection one is able to define an error correcting code of \(length\quad n,\) dimension \(k\geq n-\deg (G)- 1+g\) and \(dis\tan ce\quad d\geq \deg (G)-2g-2,\) where g is the genus of the algebraic \(curve\quad C.\) ''Classical'' Goppa codes correspond to choosing lines or genus \(0\) curves in the geometry. This paper considers the case of genus \(1\) curves, or elliptic curves for which \(k+d\geq n\). An extensive discussion of elliptic curves and the rational points of such curves over finite fields, is given as well as an algorithmic description of the construction of the codes.