The New Minimum Distance Bounds of Goppa Codes and Their Decoding

A couple of new lower bounds of the minimum distance of Goppa codes is derived, using an extended field code for a Goppa code which contains the Goppa code as its subfield-subcode. Also presented are procedures for both error-only and error-and-erasure decoding for Goppa codes up to the new lower bounds, based on the Berlekamp-Massey algorithm and the Feng-Tzeng multisequence shift-register synthesis algorithms which have been used for decoding cyclic codes up to the BCH and HT(Hartmann-Tzeng) bounds.

[1]  Elwyn R. Berlekamp,et al.  Goppa Codes , 2022 .

[2]  Masao Kasahara,et al.  A Method for Solving Key Equation for Decoding Goppa Codes , 1975, Inf. Control..

[3]  Charles T. Retter.  Decoding Goppa codes with a BCH decoder (Corresp.) , 1975, IEEE Trans. Inf. Theory.

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

[5]  Masao Kasahara,et al.  Correction to 'An Erasures-and-Errors Decoding Algorithm for Goppa Codes' , 1976 .

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

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

[8]  Masao Kasahara,et al.  An erasures-and-errors decoding algorithm for Goppa codes (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[9]  Gui Liang Feng,et al.  Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations , 1991, IEEE Trans. Inf. Theory.

[10]  Masao Kasahara,et al.  Some efficient binary codes constructed using Srivastava codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

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

[12]  Kenneth K. Tzeng,et al.  On error-and-erasure decoding of cyclic codes , 1992, IEEE Trans. Inf. Theory.

[13]  Nicholas J. Patterson,et al.  The algebraic decoding of Goppa codes , 1975, IEEE Trans. Inf. Theory.

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

[15]  Gui Liang Feng,et al.  A generalized Euclidean algorithm for multisequence shift-register synthesis , 1989, IEEE Trans. Inf. Theory.

[16]  Jean Conan,et al.  A transform approach to Goppa codes , 1987, IEEE Trans. Inf. Theory.

[17]  Kenneth K. Tzeng,et al.  On extending Goppa codes to cyclic codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

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

[19]  Masao Kasahara,et al.  Further results on Goppa codes and their applications to constructing efficient binary codes , 1976, IEEE Trans. Inf. Theory.

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