Decoding Reed Solomon Codes beyond the Error-Correction Bound (1997)
Cached
Download Links
by
Madhu Sudan
| Citations: | 183 - 16 self |
BibTeX
@MISC{Sudan97decodingreed,
author = {Madhu Sudan},
title = {Decoding Reed Solomon Codes beyond the Error-Correction Bound },
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a randomized algorithm which takes as input n distinct points f(xi; yi)g n i=1 from F \Theta 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 x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f (xi) for at least t values of i), provided t = \Omega (
