Decoding of Reed Solomon Codes beyond the Error-Correction Bound

We present a randomized algorithm which takes as inputndistinct points {(xi,yi)}i= 1nfromF×F(whereFis a field) and integer parameterstanddand returns a list of all univariate polynomialsfoverFin the variablexof degree at mostdwhich agree with the given set of points in at leasttplaces (i.e.,yi=f(xi) for at leasttvalues ofi), providedt= ?(nd). The running time is bounded by a polynomial inn. This immediately provides a maximum likelihood decoding algorithm for Reed Solomon Codes, which works in a setting with a larger number of errors than any previously known algorithm. To the best of our knowledge, this is the first efficient (i.e., polynomial time bounded) algorithm which provides error recovery capability beyond the error-correction bound of a code for any efficient (i.e., constant or even polynomial rate) code.

[1]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[2]  Leonid A. Levin,et al.  A hard-core predicate for all one-way functions , 1989, STOC '89.

[3]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[4]  V. Rich Personal communication , 1989, Nature.

[5]  Carsten Lund,et al.  On the hardness of computing the permanent of random matrices , 1992, STOC '92.

[6]  Madhu Sudan,et al.  Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..

[7]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[8]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[9]  Jacobus H. van Lint Introduction to Coding Theory , 1982 .

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

[11]  Ronitt Rubinfeld,et al.  Reconstructing Algebraic Functions from Mixed Data , 1998, SIAM J. Comput..

[12]  Ronitt Rubinfeld,et al.  Learning polynomials with queries: The highly noisy case , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[13]  Eyal Kushilevitz,et al.  Learning decision trees using the Fourier spectrum , 1991, STOC '91.

[14]  Moni Naor,et al.  The hardness of decoding linear codes with preprocessing , 1990, IEEE Trans. Inf. Theory.

[15]  Erich Kaltofen Polynomial Factorization 1987-1991 , 1992, LATIN.

[16]  ChallengesPaul ZimmermannInria Lorrainezimmermann Polynomial Factorization , 1996 .