A simple approach for construction of algebraic-geometric codes from affine plane curves

The current algebraic geometric (AG) codes are based on the theory of algebraic geometric curves. In this paper, we present a novel approach for construction of AG codes without any background in algebraic geometry. Given an affine plane irreducible curve and its all rational points, based on the equation of this curve, we can find a sequence of monomial polynomials x/sup i/y/sup j/. Using the first r polynomials as a basis of dual code of a linear code called AG code, the designed minimum distance d of this AG code can be easily determined. For these codes a fast decoding procedure with complexity O(n/sup 7/3/) which can correct errors up to [(d-1)/2], is also shown. By this approach it is neither necessary to know the genus of curve nor find a basis of differential form. This approach can be easily understood by most engineers. Some examples are also shown, which indicate that the codes constructed by this approach are better than the current AG codes from same curves.

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

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

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

[4]  Kees Roos,et al.  A new lower bound for the minimum distance of a cyclic code , 1983, IEEE Trans. Inf. Theory.

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

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

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

[8]  Carlos R. P. Hartmann,et al.  Generalizations of the BCH Bound , 1972, Inf. Control..

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

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

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

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

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

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

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

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

[17]  Jean-Pierre Serre.  Algebraic Groups and Class Fields , 1987 .

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

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

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

[21]  A.N. Skorobogatov,et al.  On the decoding of algebraic-geometric codes , 1990, IEEE Trans. Inf. Theory.