A generalized Forney formula for algebraic-geometric codes

This correspondence contains a straightforward generalization of decoding of BCH codes to the decoding of algebraic-geometric codes, couched in terms of varieties, ideals, and Grobner bases. This consists of 1) a Berlekamp-Massey-type lattice-shifting row-reduction algorithm with majority voting similar to algorithms in the current literature, 2) a realization that it produces a minimal Grobner basis B for the error-locator ideal I(V) relative to a particular weighted total degree monomial ordering, 3) a factoring of that basis into several minimal PLEX bases, that facilitates finding the variety V of error positions, and 4) a direct generalization of Forney's formula to calculate error magnitudes using functions /spl sigma/p, which are by-products of this factoring.

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

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

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

[4]  Carsten Dahl.  Fast decoding of codes from algebraic curves , 1994, IEEE Trans. Inf. Theory.

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

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

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

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

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

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

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

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

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

[14]  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..

[15]  Douglas A. Leonard.  Error-locator ideals for algebraic-geometric codes , 1995, IEEE Trans. Inf. Theory.

[16]  G. David Forney,et al.  On decoding BCH codes , 1965, IEEE Trans. Inf. Theory.

[17]  B. Z. Shen,et al.  On encoding and decoding of the codes from Hermitian curves , 1993 .