Linear-Time List Decoding in Error-Free Settings: (Extended Abstract)

This paper is motivated by the program of constructing list-decodable codes with linear-time encoding and decoding algorithms with rate comparable to or even matching the rate achieved by the best constructions with polynomial encoding/decoding complexity. We achieve this for three basic settings of list decoding, and view these as the first promising steps in the above general program.

[1]  Chris Gennings,et al.  Simulation of multivariate gamma data with exponential marginals for independent clusters , 1999 .

[2]  Gilles Zémor,et al.  On expander codes , 2001, IEEE Trans. Inf. Theory.

[3]  Ronitt Rubinfeld,et al.  Reconstructing Algebraic Functions from Mixed Data , 1998, SIAM J. Comput..

[4]  Venkatesan Guruswami,et al.  Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets , 2002, STOC '02.

[5]  Madhu Sudan,et al.  Priority encoding transmission , 1996, IEEE Trans. Inf. Theory.

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

[7]  Peter Elias,et al.  Zero error capacity under list decoding , 1988, IEEE Trans. Inf. Theory.

[8]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[9]  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).

[10]  Noga Alon,et al.  Linear time erasure codes with nearly optimal recovery , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[11]  Venkatesan Guruswami,et al.  Linear time encodable and list decodable codes , 2003, STOC '03.

[12]  Venkatesan Guruswami.  List decoding from erasures: bounds and code constructions , 2003, IEEE Trans. Inf. Theory.

[13]  Michael Alekhnovich.  Linear diophantine equations over polynomials and soft decoding of Reed-Solomon codes , 2005, IEEE Transactions on Information Theory.

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

[15]  Daniel A. Spielman.  Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.