论文信息 - Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound

Generalized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound

Summary form only given, as follows. Efficient decoding of BCH- and Reed-Solomon codes can be done using the Berlekanp-Massey (1969) algorithm, and it is natural to try to use the extension of this to N dimensions of Sakata (see Inform. Computat., vol.84, no.2, p.207, 1990) to decode algebraic geometry codes. We treat a general class of algebraic geometry codes and show how to decode these up to half the Feng-Rao (see IEEE Trans. Inform. Theory, vol.IT 39, no.1 p.37-45, 1993) bound, using an extension and modification of the Sakata algorithm. >

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

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

[3] C. Voss,et al. A family of kummer extensions of the hermitian function field , 1995 .

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

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

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

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

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

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

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

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