Algebraic-Geometry Codes

The theory of error-correcting codes derived from curves in an algebraic geometry was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed-Solomon (RS), and Goppa codes. The development of the theory has received intense consideration since that time and the purpose of the paper is to review this work. Elements of the theory of algebraic curves, at a level sufficient to understand the code constructions and decoding algorithms, are introduced. Code constructions from particular classes of curves, including the Klein quartic, elliptic, and hyperelliptic curves, and Hermitian curves, are presented. Decoding algorithms for these classes of codes, and others, are considered. The construction of classes of asymptotically good codes using modular curves is also discussed.

[1]  R. F. Lax,et al.  Goppa codes and Weierstrass gaps , 1992 .

[2]  Amin Shokrollahi,et al.  Decoding algebraic-geometric codes beyond the error-correction bound , 1998, STOC '98.

[3]  M. E. O'Sullivan Decoding of codes defined by a single point on a curve , 1995, IEEE Trans. Inf. Theory.

[4]  Thierry Henocq,et al.  The theta divisor of a jacobian variety and the decoding of geometric Goppa codes , 1996 .

[5]  W. Fulton,et al.  Algebraic Curves: An Introduction to Algebraic Geometry , 1969 .

[6]  I. Yu.,et al.  What is the maximum number of points on a curve over $F_2$? , 1982 .

[7]  Ruud Pellikaan,et al.  On the decoding of algebraic-geometric codes , 1995, IEEE Trans. Inf. Theory.

[8]  V. D. Goppa Codes and information , 1984 .

[9]  H. J. Tiersma Remarks on codes from Hermitian curves , 1987, IEEE Trans. Inf. Theory.

[10]  H. Stichtenoth Self-dual Goppa codes , 1988 .

[11]  Iwan M. Duursma,et al.  Majority coset decoding , 1993, IEEE Trans. Inf. Theory.

[12]  Anders Bjært Sørensen Projective Reed-Muller codes , 1991, IEEE Trans. Inf. Theory.

[13]  Miura Shinji,et al.  Algebraic geometric codes on certain plane curves , 1993 .

[14]  Chaoping Xing On Automorphism Groups of the Hermitian Codes , 1995, IEEE Trans. Inf. Theory.

[15]  Yu. I. Manin,et al.  Linear codes and modular curves , 1985 .

[16]  H. Niederreiter,et al.  Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .

[17]  J. Wolf Adding two information symbols to certain nonbinary BCH codes and some applications , 1969 .

[18]  Dwijendra K. Ray-Chaudhuri,et al.  Binary mixture flow with free energy lattice Boltzmann methods , 2022, arXiv.org.

[19]  Iwan M. Duursma Algebraic decoding using special divisors , 1993, IEEE Trans. Inf. Theory.

[20]  Shojiro Sakata,et al.  Finding a Minimal Set of Linear Recurring Relations Capable of Generating a Given Finite Two-Dimensional Array , 1988, J. Symb. Comput..

[21]  Iwan M. Duursma,et al.  Decoding codes from curves and cyclic codes , 1993 .

[22]  Dominique Le Brigand,et al.  Decoding of codes on hyperelliptic curves , 1990, EUROCODE.

[23]  Marc Perret,et al.  Families of codes exceeding the Varshamov-Gilbert bound , 1988, Coding Theory and Applications.

[24]  C Xing ON THE DECODING OF ALGEBRAIC-GEOMETRIC CODES , 1991 .

[25]  Tom Høholdt,et al.  An elementary approach to algebraic geometry codes , 1998 .

[26]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[27]  Henning Stichtenoth,et al.  Algebraic function fields over finite fields with many rational places , 1995, IEEE Trans. Inf. Theory.

[28]  V. D. Goppa Geometry and Codes , 1988 .

[29]  Ruud Pellikaan,et al.  On the Efficient Decoding of Algebraic-Geometric Codes , 1993 .

[30]  Ruud Pellikaan,et al.  ALGEBRAIC CURVES OVER FINITE FIELDS: (Cambridge Tracts in Mathematics 97) , 1992 .

[31]  N. Koblitz A Course in Number Theory and Cryptography , 1987 .

[32]  Gaétan Haché,et al.  Construction effective des codes geometriques , 1996 .

[33]  Victor K.-W. Wei,et al.  Introduction to the special issue on algebraic geometry codes , 1995, IEEE Trans. Inf. Theory.

[34]  Chris Heegard,et al.  Systematic encoding via Grobner bases for a class of algebraic-geometric Goppa codes , 1995, IEEE Trans. Inf. Theory.

[35]  J. H. Lint,et al.  Introduction to coding theory and algebraic geometry , 1989 .

[36]  Wolfgang Willems,et al.  Codes of Small Defect , 1997, Des. Codes Cryptogr..

[37]  Henning Stichtenoth,et al.  Coding Theory and Algebraic Geometry , 1992 .

[38]  Tom Høholdt,et al.  A Fast Decoding Method of AG Codes from Miura-Kamiya Curves Cab up to Half the Feng-Rao Bound , 1995 .

[39]  Dirk Ehrhard Über das Dekodieren algebraisch-geometrischer Codes , 1991 .

[40]  Henning Stichtenoth,et al.  Über die Automorphismengruppe eines algebraischen Funktionenkörpers von Primzahlcharakteristik , 1973 .

[41]  H. Stichtenoth,et al.  A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .

[42]  H. Stichtenoth,et al.  A criterion for self-duality of geometric codes , 1989 .

[43]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[44]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[45]  Noam D. Elkies Mordell–Weil lattices in characteristic 2 II: The Leech lattice as a Mordell–Weil lattice , 1997 .

[46]  A. Brouwer Bounds on the size of linear codes , 1998 .

[47]  A. Weil,et al.  Review: C. Chevalley, Introduction to the theory of algebraic functions of one variable , 1951 .

[48]  Dirk Ehrhard,et al.  Achieving the designed error capacity in decoding algebraic-geometric codes , 1993, IEEE Trans. Inf. Theory.

[49]  Tom Høholdt,et al.  Fast decoding of algebraic-geometric codes up to the designed minimum distance , 1995, IEEE Trans. Inf. Theory.

[50]  Gr Ruud Pellikaan,et al.  The shift bound for cyclic, Reed-Muller and geometric Goppa codes , 1996 .

[51]  Gerhard Frey,et al.  On the different of abelian extensions of global fields , 1992 .

[52]  Ruud Pellikaan,et al.  The minimum distance of codes in an array coming from telescopic semigroups , 1995, IEEE Trans. Inf. Theory.

[53]  Hao Chen,et al.  Contribution to Munuera's problem on the main conjecture of geometric hyperelliptic MDS codes , 1997, IEEE Trans. Inf. Theory.

[54]  Ruud Pellikaan,et al.  Which linear codes are algebraic-geometric? , 1991, IEEE Trans. Inf. Theory.

[55]  Dirk Ehrhard,et al.  Decoding Algebraic-Geometric Codes by solving a key equation , 1992 .

[56]  Shojiro Sakata,et al.  Extension of the Berlekamp-Massey Algorithm to N Dimensions , 1990, Inf. Comput..

[57]  M. Tsfasman,et al.  Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .

[58]  Robert J. McEliece,et al.  The Theory of Information and Coding , 1979 .

[59]  Yves Driencourt,et al.  Some Properties of Elliptic Codes Over a Field of Characteristic 2 , 1985, AAECC.

[60]  Y. Ihara,et al.  Some remarks on the number of rational points of algebratic curves over finite fields , 1982 .

[61]  Johan P. Hansen,et al.  Codes on the Klein quartic, ideals, and decoding , 1987, IEEE Trans. Inf. Theory.

[62]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[63]  Tom Høholdt,et al.  Construction and decoding of a class of algebraic geometry codes , 1989, IEEE Trans. Inf. Theory.

[64]  Shreeram S. Abhyankar,et al.  Irreducibility criterion for germs of analytic functions of two complex variables , 1989 .

[65]  Ian F. Blake,et al.  Hermitian codes as generalized Reed-Solomon codes , 1992, Des. Codes Cryptogr..

[66]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

[67]  Carlos J. Moreno,et al.  Algebraic curves over finite fields: Frontmatter , 1991 .

[68]  R. Pellikaan,et al.  Weierstrass Semigroups in an Asymptotically Good Tower of Function Fields , 1998 .

[69]  P. V. Kumar,et al.  On the true minimum distance of Hermitian codes , 1992 .

[70]  Rudolf Lide,et al.  Finite fields , 1983 .

[71]  T. R. N. Rao,et al.  Improved geometric Goppa codes. I. Basic theory , 1995, IEEE Trans. Inf. Theory.

[72]  Alfred Menezes,et al.  Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.

[73]  F. Torres,et al.  Algebraic Curves over Finite Fields , 1991 .

[74]  S. C. Porter,et al.  Decoding codes arising from Goppa's construction on algebraic curves , 1988 .

[75]  Tadao Kasami,et al.  New generalizations of the Reed-Muller codes-I: Primitive codes , 1968, IEEE Trans. Inf. Theory.

[76]  Y. Driencourt,et al.  Elliptic codes over fields of characteristics 2 , 1987 .

[77]  Ruud Pellikaan,et al.  On a decoding algorithm for codes on maximal curves , 1989, IEEE Trans. Inf. Theory.

[78]  R. J. Walker Algebraic curves , 1950 .

[79]  Ba-Zhong Shen,et al.  Generation of matrices for determining minimum distance and decoding of algebraic-geometric codes , 1995, IEEE Trans. Inf. Theory.

[80]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[81]  Shojiro Sakata Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm , 1991, IEEE Trans. Inf. Theory.

[82]  Tom Høholdt,et al.  Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound , 1994, IEEE Trans. Inf. Theory.

[83]  J. A. Thiong-Ly,et al.  Decoding of codes on the Klein Quartic , 1990, EUROCODE.

[84]  Chris Heegard,et al.  On Hyperbolic Cascaded Reed-Solomon Codes , 1993, AAECC.

[85]  I. Shafarevich,et al.  Basic algebraic geometry 1 (2nd, revised and expanded ed.) , 1994 .

[86]  Jørn Justesen,et al.  Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.

[87]  H. Stichtenoth,et al.  On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields , 1996 .

[88]  Hao Chen,et al.  On the main conjecture of geometric MDS codes , 1994 .

[89]  V. D. Goppa Codes on Algebraic Curves , 1981 .

[90]  Mario A. de Boer,et al.  Almost MDS codes , 1996, Des. Codes Cryptogr..

[91]  W. W. Peterson,et al.  Encoding and error-correction procedures for the Bose-Chaudhuri codes , 1960, IRE Trans. Inf. Theory.

[92]  Henning Stichtenoth,et al.  Generalized Hamming weights of trace codes , 1994, IEEE Trans. Inf. Theory.

[93]  Elwyn R. Berlekamp,et al.  On decoding binary Bose-Chadhuri- Hocquenghem codes , 1965, IEEE Trans. Inf. Theory.

[94]  C. Hoffmann Algebraic curves , 1988 .

[95]  James W. P. Hirschfeld,et al.  The weight hierarchy of higher dimensional Hermitian codes , 1994, IEEE Trans. Inf. Theory.

[96]  Noam D. Elkies,et al.  Mordell-Weil Lattices in Characteristic 2 : I . Construction and First Properties , 1997 .

[97]  Ruud Pellikaan,et al.  Decoding geometric Goppa codes using an extra place , 1992, IEEE Trans. Inf. Theory.

[98]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

[99]  Richard M. Wilson,et al.  On the minimum distance of cyclic codes , 1986, IEEE Trans. Inf. Theory.

[100]  Donal O'Shea,et al.  Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.

[101]  T. R. N. Rao,et al.  Decoding algebraic-geometric codes up to the designed minimum distance , 1993, IEEE Trans. Inf. Theory.

[102]  Philippe Delsarte,et al.  On subfield subcodes of modified Reed-Solomon codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[103]  Felix Klein,et al.  Ueber die Transformation siebenter Ordnung der elliptischen Functionen , 1878 .

[104]  T. R. N. Rao,et al.  A Class of Algebraic Geometric Codes from Curves in High-Dimensional Projective Spaces , 1993, AAECC.

[105]  T. R. N. Rao,et al.  A simple approach for construction of algebraic-geometric codes from affine plane curves , 1993, IEEE Trans. Inf. Theory.

[106]  R. Fricke,et al.  Über die Transformation siebenter Ordnung der elliptischen Funktionen , 1923 .

[107]  R. F. Lax,et al.  Consecutive Weierstrass gaps and minimum distance of Goppa codes , 1993 .

[108]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[109]  Michael A. Tsfasman,et al.  Modular curves and codes with a polynomial construction , 1984, IEEE Trans. Inf. Theory.

[110]  Tom Høholdt,et al.  An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound: The first steps , 1997, IEEE Trans. Inf. Theory.

[111]  Henning Stichtenoth On the dimension of subfield subcodes , 1990, IEEE Trans. Inf. Theory.

[112]  Jean-Marie Goethals,et al.  On Generalized Reed-Muller Codes and Their Relatives , 1970, Inf. Control..

[113]  Serge G. Vladut,et al.  On the decoding of algebraic-geometric codes over Fq for q>=16 , 1990, IEEE Trans. Inf. Theory.

[114]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[115]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[116]  Henning Stichtenoth,et al.  Über die Automorphismengruppe eines algebraischen Funktionenkörpers von Primzahlcharakteristik , 1973 .

[117]  G. Geer Codes and Elliptic Curves , 1991 .

[118]  T. Johnsen,et al.  A determination of the parameters of a large class of Goppa codes , 1994, IEEE Trans. Inf. Theory.

[119]  Judy L. Walker,et al.  Codes and Curves , 2000, Student mathematical library.

[120]  Henning Stichtenoth,et al.  A note on Hermitian codes over GF(q2) , 1988, IEEE Trans. Inf. Theory.

[121]  S. G. Vladut,et al.  Algebraic-Geometric Codes , 1991 .

[122]  Victor K.-W. Wei,et al.  Simplified understanding and efficient decoding of a class of algebraic-geometric codes , 1994, IEEE Trans. Inf. Theory.

[123]  Chris Heegard,et al.  Cyclic Codes: A Unified Theory and Algorithms for Decoding Using Grobner Bases , 1995 .

[124]  Douglas A. Leonard,et al.  A generalized Forney formula for algebraic-geometric codes , 1996, IEEE Trans. Inf. Theory.

[125]  V. D. Goppa ALGEBRAICO-GEOMETRIC CODES , 1983 .

[126]  T. Moh,et al.  Newton-Puiseux expansion and generalized Tschirnhausen transformation. I. , 1973 .

[127]  L. Welch,et al.  Improved geometric Goppa codes , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[128]  Jacobus H. van Lint,et al.  Generalized Reed - Solomon codes from algebraic geometry , 1987, IEEE Trans. Inf. Theory.

[129]  J. Guiver,et al.  Multidimensional systems theory : progress, directions and open problems in multidimensional systems , 1985 .

[130]  S. Abhyankar Algebraic geometry for scientists and engineers , 1990 .

[131]  Gui Liang Feng,et al.  A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes , 1991, IEEE Trans. Inf. Theory.

[132]  S. Vladut,et al.  Number of points of an algebraic curve , 1983 .

[133]  Tom Høholdt,et al.  Fast decoding of codes from algebraic plane curves , 1992, IEEE Trans. Inf. Theory.

[134]  Gilles Lachaud,et al.  Les codes géométriques de Goppa , 1985 .