Maximum likelihood decoding of Reed Solomon codes

We present a randomized algorithm which takes as input n distinct points {(x_i,y_i)}_i=1ⁿ from F×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_i=f(x_i) for at least t values of i), provided t=Ω(√(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