List-decoding of binary Goppa codes up to the binary Johnson bound

We study the list-decoding problem of alternant codes (which includes obviously that of classical Goppa codes). The major consideration here is to take into account the (small) size of the alphabet. This amounts to comparing the generic Johnson bound to the q-ary Johnson bound. The most favourable case is q = 2, for which the decoding radius is greatly improved. Even though the announced result, which is the list-decoding radius of binary Goppa codes, is new, we acknowledge that it can be made up from separate previous sources, which may be a little bit unknown, and where the binary Goppa codes has apparently not been thought at. Only D. J. Bernstein has treated the case of binary Goppa codes in a preprint. References are given in the introduction. We propose an autonomous and simplified treatment and also a complexity analysis of the studied algorithm, which is quadratic in the blocklength n, when decoding e-away of the relative maximum decoding radius.

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

[2]  Daniel Augot,et al.  A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes , 2000, IEEE Trans. Inf. Theory.

[3]  Daniel J. Bernstein,et al.  Simplified High-Speed High-Distance List Decoding for Alternant Codes , 2011, PQCrypto.

[4]  Venkatesan Guruswami,et al.  Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..

[5]  Tanja Lange,et al.  Wild McEliece , 2010, IACR Cryptol. ePrint Arch..

[6]  Ron M. Roth,et al.  Introduction to Coding Theory , 2019, Discrete Mathematics.

[7]  Peter Beelen,et al.  Key equations for list decoding of Reed-Solomon codes and how to solve them , 2010, J. Symb. Comput..

[8]  Venkatesan Guruswami,et al.  List Decoding of Error-Correcting Codes (Winning Thesis of the 2002 ACM Doctoral Dissertation Competition) , 2005, Lecture Notes in Computer Science.

[9]  Alexander Vardy,et al.  The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes , 2011, IEEE Transactions on Information Theory.

[10]  Alexander Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2003, IEEE Trans. Inf. Theory.

[11]  M. Tsfasman,et al.  Algebraic Geometric Codes: Basic Notions , 2007 .

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

[13]  Ron M. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 2000, IEEE Trans. Inf. Theory.

[14]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

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

[16]  Yingquan Wu,et al.  New List Decoding Algorithms for Reed–Solomon and BCH Codes , 2007, IEEE Transactions on Information Theory.

[17]  Ido Tal,et al.  On list decoding of alternant codes in the hamming and lee metrics , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[18]  Tanja Lange,et al.  Wild McEliece Incognito , 2011, PQCrypto.

[19]  A. Vardy,et al.  Algebraic soft-decision decoding of Reed-Solomon codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[20]  Peter Elias,et al.  Error-correcting codes for list decoding , 1991, IEEE Trans. Inf. Theory.

[21]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[22]  V TrifonovPeter.  Efficient interpolation in the Guruswami-Sudan algorithm , 2010 .

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

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

[25]  Yuan Zhou.  Introduction to Coding Theory , 2010 .

[26]  Cem Güneri.  Algebraic geometric codes: basic notions , 2008 .

[27]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

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

[29]  Peter Beelen,et al.  Efficient list decoding of a class of algebraic-geometry codes , 2010, Adv. Math. Commun..

[30]  Michael Alekhnovich.  Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes , 2005, IEEE Transactions on Information Theory.

[31]  Daniel J. Bernstein.  List Decoding for Binary Goppa Codes , 2011, IWCC.

[32]  Peter Trifonov.  Efficient Interpolation in the Guruswami–Sudan Algorithm , 2010, IEEE Transactions on Information Theory.

[33]  W. Fulton.  Algebraic curves , 1969 .

[34]  Bruno Buchberger,et al.  The Construction of Multivariate Polynomials with Preassigned Zeros , 1982, EUROCAM.