Maximum likelihood decoding of Reed Solomon codes

We present a randomized algorithm which takes as input n distinct points {(x/sub i/,y/sub i/)}/sub i=1//sup n/ from F/spl times/F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable a of degree at most d which agree with the given set of points in at least t places (i.e., y/sub i/=f(x/sub i/) for at least t values of i), provided t=/spl Omega/(/spl radic/(nd)). The running time is bounded by a polynomial in n. 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 some maximum likelihood decoding for any efficient (i.e., constant or even polynomial rate) code.

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

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

[3]  Ronitt Rubinfeld,et al.  Reconstructing algebraic functions from mixed data , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[5]  Carsten Lund,et al.  On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) , 1992, STOC.

[6]  Erich Kaltofen,et al.  Polynomial Factorization 1987-1991 , 1992, LATIN.

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

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

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

[10]  Jacobus H. van Lint,et al.  Introduction to Coding Theory , 1982 .

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

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

[13]  ChallengesPaul ZimmermannInria Lorrainezimmermann.  Polynomial Factorization , 1996 .

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

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

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