Correcting errors beyond the Guruswami-Sudan radius in polynomial time

We introduce a new family of error-correcting codes that have a polynomial-time encoder and a polynomial-time list-decoder, correcting a fraction of adversarial errors up to /spl tau//sub M/ = 1 - /sup M+1//spl radic/(M/sup M/R/sup M/) where R is the rate of the code and M /spl ges/ 1 is an arbitrary integer parameter. This makes it possible to decode beyond the Guruswami-Sudan radius of 1 /spl radic/R for all rates less than 1/16. Stated another way, for any /spl epsiv/ > 0, we can list-decode in polynomial time a fraction of errors up to 1 - /spl epsiv/ with a code of length n and rate /spl Omega/(/spl epsiv//log(1//spl epsiv/)), defined over an alphabet of size n/sup M/ = n/sup O(log(1//spl epsiv/))/. Notably, this error-correction is achieved in the worst-case against adversarial errors: a probabilistic model for the error distribution is neither needed nor assumed. The best results so far for polynomial-time list-decoding of adversarial errors required a rate of O(/spl epsiv//sup 2/) to achieve the correction radius of 1 - /spl epsiv/. Our codes and list-decoders are based on two key ideas. The first is the transition from bivariate polynomial interpolation, pioneered by Sudan and Guruswami-Sudan [1999], to multivariate interpolation decoding. The second idea is to part ways with Reed-Solomon codes, for which numerous prior attempts at breaking the O(/spl epsiv//sup 2/) rate barrier in the worst-case were unsuccessful. Rather than devising a better list-decoder for Reed-Solomon codes, we devise better codes. Standard Reed-Solomon encoders view a message as a polynomial f(X) over a field F/sub q/, and produce the corresponding codeword by evaluating f(X) at n distinct elements of F/sub q/. Herein, given f(X), we first compute one or more related polynomials g/sub 1/(X), g/sub 2/(X), ..., g/sub M-1/(X) and produce the corresponding codeword by evaluating all these polynomials. Correlation between f(X) and g/sub i/(X), carefully designed into our encoder, then provides the additional information we need to recover the encoded message from the output of the multivariate interpolation process.

[1]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[2]  Venkatesan Guruswami,et al.  Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.

[3]  Alexander Vardy,et al.  Divide-and-conquer interpolation for list decoding of reed-solomon codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

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

[6]  Joachim von zur Gathen,et al.  Exponentiation in Finite Fields: Theory and Practice , 1997, AAECC.

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

[8]  Helmut Hasse,et al.  Number Theory , 2020, An Introduction to Probabilistic Number Theory.

[9]  Venkatesan Guruswami,et al.  Expander-based constructions of efficiently decodable codes , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[10]  Aggelos Kiayias,et al.  Decoding of Interleaved Reed Solomon Codes over Noisy Data , 2003, ICALP.

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

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

[13]  Alexander Vardy,et al.  On the Performance of Multivariate Interpolation Decoding of Reed-Solomon Codes , 2006, 2006 IEEE International Symposium on Information Theory.

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

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

[16]  Victor Shoup.  A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic , 1991, ISSAC '91.

[17]  Venkatesan Guruswami,et al.  List decoding of error correcting codes , 2001 .

[18]  Venkatesan Guruswami.  Algebraic-geometric generalizations of the Parvaresh-Vardy codes , 2005, Electron. Colloquium Comput. Complex..

[19]  Alexander Vardy,et al.  Multivariate interpolation decoding beyond the Guruswami-Sudan radius , 2004 .

[20]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discrete Mathematics.

[21]  Venkatesan Guruswami.  Better extractors for better codes? , 2004, STOC '04.

[22]  Madhu Sudan,et al.  Reconstructing curves in three (and higher) dimensional space from noisy data , 2003, STOC '03.