Subspace polynomials and list decoding of Reed-Solomon codes
Author(s)
Kopparty, Swastik
DownloadFull printable version (1.299Mb)
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Madhu Sudan.
Terms of use
Metadata
Show full item recordAbstract
We show combinatorial limitations on efficient list decoding of Reed-Solomon codes beyond the Johnson and Guruswami-Sudan bounds [Joh62, Joh63, GS99]. In particular, we show that for any ... , there exist arbitrarily large fields ... * Existence: there exists a received word ... that agrees with a super-polynomial number of distinct degree K polynomials on ... points each; * Explicit: there exists a polynomial time constructible received word ... that agrees with a super-polynomial number of distinct degree K polynomials, on ... points each. Ill both cases, our results improve upon the previous state of the art, which was , NM/6 for the existence case [JH01], and a ... for the explicit one [GR,05b]. Furthermore, for 6 close to 1 our bound approaches the Guruswami-Sudan bound (which is ... ) and rules out the possibility of extending their efficient RS list decoding algorithm to any significantly larger decoding radius. Our proof method is surprisingly simple. We work with polynomials that vanish on subspaces of an extension field viewed as a vector space over the base field. (cont.) These subspace polynomials are a subclass of linearized polynomials that were studied by Ore [Ore33, Ore34] in the 1930s and by coding theorists. For us their main attraction is their sparsity and abundance of roots. We also complement our negative results by giving a list decoding algorithm for linearized polynomials beyond the Johnson-Guruswami-Sudan bounds.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2007. Includes bibliographical references (p. 29-31).
Date issued
2007Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer SciencePublisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.