Optimal Rate List Decoding via Derivative Codes

The classical family of [n, k]q Reed-Solomon codes over a field Fq consist of the evaluations of polynomials f ∈ Fq[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.

[1]  Venkatesan Guruswami,et al.  Limits to List Decoding Reed-Solomon Codes , 2006, IEEE Trans. Inf. Theory.

[2]  Alexander Vardy,et al.  Correcting errors beyond the Guruswami-Sudan radius in polynomial time , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[3]  Madhu Sudan,et al.  Highly Resilient Correctors for Polynomials , 1992, Inf. Process. Lett..

[4]  Venkatesan Guruswami,et al.  Algorithmic Results in List Decoding , 2006, Found. Trends Theor. Comput. Sci..

[5]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[6]  Venkatesan Guruswami,et al.  Linear-Algebraic List Decoding of Folded Reed-Solomon Codes , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

[7]  Venkatesan Guruswami,et al.  Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy , 2005, IEEE Transactions on Information Theory.

[8]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[9]  Swastik Kopparty List-Decoding Multiplicity Codes , 2012, Theory Comput..

[10]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[11]  Venkatesan Guruswami List decoding with side information , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[12]  Venkatesan Guruswami Cyclotomic function fields, Artin–Frobenius automorphisms, and list error correction with optimal rate , 2010 .