Binary spherical geometric codes
Let q be a power of an odd prime number and Fq be the finite field with q elements. We will construct a binary spherical code from an algebraic curve C defined over Fq and a rational divisor G on C, as the twist by the quadratic character η of the Goppa code L(G). The computation of the parameters of this code is based on the study of some character sums.
Unable to display preview. Download preview PDF.
- Conway, J. H. and Sloane, N. J. A. "Sphere packing, Lattices and Groups", Springer-Verlag, New-York, 1988.Google Scholar
- Perret, M. "Multiplicative character sums and Kummer coverings", Acta Arithmetica, 59 no3 (1991), p. 75–86.Google Scholar
- Perret, M. "Multiplicative character sums and non linear geometric codes", symposia of Eurocode 90, to appear in Lecture Notes in Computer Sciences, Springer.Google Scholar