Error correction up to the information-theoretic limit

Communications of the ACM

Volumn 52, Issue 3, 2009, Pages 87-95

  Guruswami, Venkatesan ^a,b   Rudra, Atri ^c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b Carnegie Mellon University ^*  (United States)

^c UNIVERSITY AT BUFFALO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORIES; CONVENTIONAL ALGORITHMS; ERROR-CORRECTION SCHEMES; INFORMATION-THEORETIC LIMITS; LIST DECODING; RECENT PROGRESS; WORST-CASE ERRORS;

COMPUTER PROGRAMMING; DECODING; INFORMATION THEORY; QUALITY ASSURANCE; REDUNDANCY;

ERROR CORRECTION;

EID: 61849115651     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1467247.1467269     Document Type: Article

References (19)

1. Berlekarnp, E. Factoring polynomials over large finite fields. Math. Comput. 24 (1970), 713-735.
2. Elias, P. List decoding for noisy channels. Technical Report 335, MIT Research Lab of Electronics, 1957.
3. Gernmell, P., Sudan, M. Highly resilient correctors for multivariate polynomials. Information Processing Lett. 43. 4 (1992), 169-174.
4. Goldreich, O., Levin, L. A hard-core predicate for all one-way functions. In Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, 25-32.
5. Guruswami, V. Artin automorphisms, cyclotomic function fields, and folded list-decodable codes. 2008. Manuscript.
6. Guruswami, V., Indyk, P. Linear-time encodable/decodable codes with near-optimal rate, IEEE Trans. Information Theory 51, 10 (2005), 3393-3400.
7. Guruswami, V., Patthak, A. Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets. Math. Comput, 77, 261 (Jan. 2008), 447-473.
8. Guruswami, V., Rudra, A, Better binary list decodable codes via multilevel concatenation. In Proceedigs of the 11th International Workshop on Randomization and Computation, 2007, 554-568.
9. Guruswami, V., Rudra, A. Explicit codes achieving list decoding capacity: Error-correction up to the Singleton bound. IEEE Trans. Information Theory 54, 1 (2008), 135-150. Preliminary version in STOC'06.
10. Guruswami, V., Sudan, M, Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Trans. Information Theory, 45 (1999), 1757-1767.
11. Guruswami, V., Umans, C., Vadhan, S.P. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In Proceedings of 22nd IEEE Conference on Computational. Complexity, 2007, 96-108.
12. Hamming, R.W. Error detecting and error correcting codes. Bell System Technical J. 29 (Apr. 1950), 147-160.
13. Koetter, R., Vardy, A. Algebraic soft-decision decoding of Reed-Solomon codes. IEEE Trans, Information Theory 49, 11 (2003), 2809-2825.
14. Parvaresh, F., Vardy, A. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 46th IEEE Symposium on Foundations of Computer Science, 2005, 285-294.
15. Peterson, W.W. Encoding and error-correction procedures for Bose-Chaudhuri codes. IEEE Trans. Information Theory, 6 (1960) ,459-470.
16. Shannon, C.E. A mathematical theory of communication. Bell System Technical J. 27 (1948), 379-423, 623-656.
17. Sudan, M. Decoding of Reed-Solomon codes beyond the error-correction bound. J. Complexity, 13, 1 (1997), 180-193.
18. Welch, L.R., Berlekamp, E.R. Error-correction of algebraic block codes. US Patent Number 4,633,470, December 1986.
19. Wozencraft, J.M. List Decoding. Quarterly Progress Report, Research Laboratory of Electronics, MIT, 48 (1953), 90-95.