About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Journal of Complexity
Paper
Decoding of Reed Solomon codes beyond the error-correction bound
Abstract
We present a randomized algorithm which takes as inputndistinct points {(x i ,y i )} i= 1n fromF×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.,y i =f(x i ) 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. © 1997 Academic Press.