Abstract
The classical family of [n,k] q Reed-Solomon codes over a field \(\mathbb{F}_q\) consist of the evaluations of polynomials \(f \in \mathbb{F}_q[X]\) of degree < k at n distinct field elements. In this work, we consider a closely related family of codes, called (order m) derivative codes and defined over fields of large characteristic, which consist of the evaluations of f as well as its first m − 1 formal derivatives at n distinct field elements. For large enough m, we show that these codes can be list-decoded in polynomial time from an error fraction approaching 1 − R, where R = k/(nm) is the rate of the code. This gives an alternate construction to folded Reed-Solomon codes for achieving the optimal trade-off between rate and list error-correction radius.
Our decoding algorithm is linear-algebraic, and involves solving a linear system to interpolate a multivariate polynomial, and then solving another structured linear system to retrieve the list of candidate polynomials f. The algorithm for derivative codes offers some advantages compared to a similar one for folded Reed-Solomon codes in terms of efficient unique decoding in the presence of side information.
Research supported in part by NSF CCF-0963975 and MSR-CMU Center for Computational Thinking.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bombieri, E., Kopparty, S.: List decoding multiplicity codes (2011) (manuscript)
Gemmell, P., Sudan, M.: Highly resilient correctors for multivariate polynomials. Information Processing Letters 43(4), 169–174 (1992)
Guruswami, V.: List decoding with side information. In: Proceedings of the 18th IEEE Conference on Computational Complexity (CCC), pp. 300–309 (2003)
Guruswami, V.: Algorithmic Results in List Decoding. Foundations and Trends in Theoretical Computer Science (FnT-TCS), vol. 2. NOW publishers (January 2007)
Guruswami, V.: Cyclotomic function fields, Artin-Frobenius automorphisms, and list error-correction with optimal rate. Algebra and Number Theory 4(4), 433–463 (2010)
Guruswami, V.: Linear-algebraic list decoding of folded Reed-Solomon codes. In: Proceedings of the 26th IEEE Conference on Computational Complexity (June 2011)
Guruswami, V., Rudra, A.: Limits to list decoding Reed-Solomon codes. IEEE Transactions on Information Theory 52(8), 3642–3649 (2006)
Guruswami, V., Rudra, A.: Explicit codes achieving list decoding capacity: Error-correction up to the Singleton bound. IEEE Transactions on Information Theory 54(1), 135–150 (2008)
Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and Algebraic-geometric codes. IEEE Transactions on Information Theory 45(6), 1757–1767 (1999)
Kopparty, S., Saraf, S., Yekhanin, S.: High-rate codes with sublinear-time decoding. Electronic Colloquium on Computational Complexity, TR10-148 (2010)
Parvaresh, F., Vardy, A.: Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 285–294 (2005)
Sudan, M.: Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity 13(1), 180–193 (1997)
Vadhan, S.: Pseudorandomness. Foundations and Trends in Theoretical Computer Science (FnT-TCS). NOW publishers (2010) (to appear) Draft available at, http://people.seas.harvard.edu/~salil/pseudorandomness/
Welch, L.R., Berlekamp, E.R.: Error correction of algebraic block codes. US Patent Number 4, 633, 470 (December 1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guruswami, V., Wang, C. (2011). Optimal Rate List Decoding via Derivative Codes. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2011 2011. Lecture Notes in Computer Science, vol 6845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22935-0_50
Download citation
DOI: https://doi.org/10.1007/978-3-642-22935-0_50
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22934-3
Online ISBN: 978-3-642-22935-0
eBook Packages: Computer ScienceComputer Science (R0)