Algorithmic results in list decoding

Foundations and Trends in Theoretical Computer Science

Volumn 2, Issue 2, 2006, Pages 107-195

  Guruswami, Venkatesan ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODING ERRORS; COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; ENCODING (SYMBOLS); ERROR CORRECTION;

DECODING ALGORITHM; ERROR CORRECTING CODES; LIST DECODING;

DECODING;

EID: 34047190329     PISSN: 1551305X     EISSN: 15513068     Source Type: Journal    
DOI: 10.1561/0400000007     Document Type: Article

References (79)

1. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth, "Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs," IEEE Transactions on Information Theory, vol. 38, pp. 509-516, 1992.
2. N. Alon and F. R. K. Chung, "Explicit construction of linear sized tolerant networks," Discrete Mathematics, vol. 72, pp. 15-19, 1988.
3. N. Alon and M. Luby, "A linear time erasure-resilient code with nearly optimal recovery," IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1732-1736, 1996.
4. N. Alon and J. Spencer, The Probabilistic Method. John Wiley and Sons, Inc., 1992.
5. S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan, "Reconstructing algebraic functions from mixed data," SIAM Journal on Computing, vol. 28, no. 2, pp. 488-511, 1999.
6. E. Berlekamp, "Factoring polynomials over large finite fields," Mathematics of Computation, vol. 24, pp. 713-735, 1970.
7. D. Bleichenbacher, A. Kiayias, and M. Yung, "Decoding of interleaved Reed Solomon codes over noisy data," in Proceedings of the 30th International Colloquium on Automata, Languages and Programming, pp. 97-108, 2003.
8. V. M. Blinovsky, "Bounds for codes in the case of list decoding of finite volume," Problems of Information Transmission, vol. 22, no. 1, pp. 7-19, 1986.
9. V. M. Blinovsky, "Code bounds for multiple packings over a nonbinary finite alphabet," Problems of Information Transmission, vol. 41, no. 1, pp. 23-32, 2005.
10. D. Boneh, "Finding smooth integers in short intervals using CRT decoding," in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 265-272, 2000.
11. D. Coppersmith and M. Sudan, "Reconstructing curves in three (and higher) dimensional spaces from noisy data," in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 136-142, June 2003.
12. I. Dumer, D. Micciancio, and M. Sudan, "Hardness of approximating the minimum distance of a linear code," IEEE Transactions on Information Theory, vol. 49, no. 1, pp. 22-37, 2003.
13. P. Elias, "List decoding for noisy channels," Technical Report 335, Research Laboratory of Electronics, MIT, 1957.
14. P. Elias, "Error-correcting codes for list decoding," IEEE Transactions on Information Theory, vol. 37, pp. 5-12, 1991.
15. G. D. Forney, Concatenated Codes. MIT Press, Cambridge, MA, 1966.
16. P. Gemmell and M. Sudan, "Highly resilient correctors for multivariate polynomials," Information Processing Letters, vol. 43, no. 4, pp. 169-174, 1992.
17. O. Goldreich and L. Levin, "A hard-core predicate for all one-way functions," in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 25-32, May 1989.
18. O. Goldreich, D. Ron, and M. Sudan, "Chinese remaindering with errors," IEEE Transactions on Information Theory, vol. 46, no. 5, pp. 1330-1338, July 2000.
19. O. Goldreich, R. Rubinfeld, and M. Sudan, "Learning polynomials with queries: The highly noisy case," in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pp. 294-303, 1995.
20. O. Goldreich, R. Rubinfeld, and M. Sudan, "Learning polynomials with queries: The highly noisy case," SIAM Journal on Discrete Mathematics, vol. 13, no. 4, pp. 535-570, November 2000.
21. P. Gopalan, R. Lipton, and Y. Ding, "Error correction against computationally bounded adversaries," Theory of Computing Systems, to appear.
22. V. Guruswami, "Iterative decoding of low-density parity check codes (A Survey)," CoRR, cs.IT/0610022, 2006. Appears in Issue 90 of the Bulletin of the EATCS.
23. V. Guruswami, "List decoding with side information," in Proceedings of the 18th IEEE Conference on Computational Complexity (CCC), pp. 300-309, July 2003.
24. V. Guruswami, "Limits to list decodability of linear codes," in Proceedings of the 34th ACM Symposium on Theory of Computing, pp. 802-811, 2002.
25. V. Guruswami, "List decoding from erasures: Bounds and code constructions," IEEE Transactions on Information Theory, vol. 49, no. 11, pp. 2826-2833, 2003.
26. V. Guruswami, "Better extractors for better codes?," in Proceedings of 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 436-444, June 2004.
27. V. Guruswami, "Error-correcting codes and expander graphs," SIGACT News, pp. 25-41, September 2004.
28. V. Guruswami, "List decoding of error-correcting codes," Lecture Notes in Computer Science, no. 3282, Springer, 2004.
29. V. Guruswami, "List decoding in pseudorandomness and average-case complexity," in IEEE Information Theory Workshop, March 2006.
30. V. Guruswami, J. Hastad, M. Sudan, and D. Zuckerman, "Combinatorial bounds for list decoding," IEEE Trunsactions on Information Theory, vol. 48, no. 5, pp. 1021-1035, 2002.
31. V. Guruswami and P. Indyk, "Expander-based constructions of efficiently decodable codes," in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 658-667, 2001.
32. V. Guruswami and P. Indyk, "Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets," in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 812-821, 2002.
33. V. Guruswami and P. Indyk, "Linear-time encodable and list decodable codes," in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 126-135, June 2003.
34. V. Guruswami and P. Indyk, "Linear-time list decoding in error-free settings," in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), pp. 695-707, July 2004.
35. V. Guruswami and P. Indyk, "Linear-time encodable/decodable codes with near-optimal rate," IEEE Transactions on Information Theory, vol. 51, no. 10, pp. 3393-3400, October 2005.
36. V. Guruswami and A. Patthak, "Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets," in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 227-238, October 2006. Journal version to appear in Mathematics of Computation.
37. V. Guruswami and A. Rudra, "Explicit capacity-achieving list-decodable codes," in Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 1-10, May 2006.
38. V. Guruswami and A. Rudra, "Limits to list decoding Reed-Solomon codes," IEEE Transactions on Information Theory, vol. 52, no. 8, August 2006.
39. V. Guruswami, A. Sahai, and M. Sudan, "Soft-decision decoding of Chinese remainder codes," in Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, pp. 159-168, 2000.
40. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometric codes," IEEE Transactions on Information Theory, vol. 45, pp. 1757-1767, 1999.
41. V. Guruswami and M. Sudan, "List decoding algorithms for certain concatenated codes," in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), pp. 181-190, 2000.
42. V. Guruswami and M. Sudan, "Decoding concatenated codes using soft information," in Proceedings of the 17th Annual IEEE Conference on Computational Complexity (CCC), pp. 148-157, 2002.
43. V. Guruswami and M. Sudan, "On representations of algebraic-geometric codes," IEEE Transactions on Information Theory, vol. 47, no. 4, pp. 1610-1613, May 2001.
44. V. Guruswami, C. Umans, and S. Vadhan, "Extractors and condensers from univariate polynomials," Electronic Colloquium, on Computational Complexity, Report TR06-134, October 2006.
45. V. Guruswami and S. Vadhan, "A lower bound on list size for list decoding," in Proceedings of the 9th International Workshop on Randomization and Computation (RANDOM), pp. 318-329, 2005.
46. R. W. Hamming, "Error detecting and error correcting codes," Bell System Technical Journal, vol. 29, pp. 147-160, April 1950.
47. R. Impagliazzo, R. Jaiswal, and V. Kabanets, "Approximately list-decoding direct product codes and uniform hardness amplification," in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science, October 2006.
48. K. Jain and R. Venkatesan, "Efficient code construction via cryptographic assumptions," in Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing, 2003.
49. R. Koetter, "On optimal weight assignments for multivariate interpolation list-decoding," in IEEE Information Theory Workshop, March 2006.
50. R. Koetter and A. Vardy, "Soft decoding of Reed Solomon codes and optimal weight assignments," in ITG Fachtagung, January 2002. Berlin, Germany.
51. R. Koetter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Transactions on Information Theory, vol. 49, no. 11, pp. 2809-2825, 2003.
52. V. Y. Krachkovsky, "Reed-Solomon codes for correcting phased error bursts," IEEE Transactions on Information Theory, vol. 49, no. 11, pp. 2975-2984, November 2003.
53. M. Langberg, "Private codes or succinct random codes that are (almost) Perfect," in Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 325-334, 2004.
54. A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," IEEE Transactions on Information Theory, vol. 44, no. 6, October 1998.
55. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge, MA, 1986.
56. R. J. Lipton, "A new approach to information theory," in Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 699-708, 1994.
57. C.-J. Lu, O. Reingold, S. P. Vadhan, and A. Wigderson, "Extractors: Optimal up to constant factors," in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 602-611, 2003.
58. R. J. McEliece, "On the average list size for the Guruswami-Sudan decoder," in 7th International Symposium on Communications Theory and Applications (ISCTA), July 2003.
59. R. J. McEliece and L. Swanson, "On the decoder error probability for Reed-Solomon codes," IEEE Transactions on Information Theory, vol. 32, no. 5, pp. 701-703, 1986.
60. S. Micali, C. Peikert, M. Sudan, and D. A. Wilson, "Optimal error correction against computationally bounded noise," in Proceedings of the 2nd Theory of Cryptography Conference (TCC), pp. 1-16, 2005.
61. F. Parvaresh and A. Vardy, "Multivariate interpolation decoding beyond the Guruswami-Sudan radius," in Proceedings of the 42nd Allerton Conference on Communication, Control and Computing, 2004.
62. F. Parvaresh and A. Vardy, "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.
63. W. W. Peterson, "Encoding and error-correction procedures for Bose-Chaudhuri codes," IEEE Transactions on Information Theory, vol. 6, pp. 459-470, 1960.
64. J. Radhakrishnan, "Proof of q-ary Johnson bound," 2006. Personal Communication.
65. C. E. Shannon, "A mathematical theory of communication," Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, 1948.
66. M. Sipser and D. Spielman, "Expander codes," IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1710-1722, 1996.
67. A. Smith, "Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes," Cryptology ePrint Archive, Report 2006/020, http://eprint.iacr.org/, 2006.
68. D. Spielman, "Linear-time encodable and decodable error-correcting codes," IEEE Transactions on Information Theory, vol. 42, no. 6, pp. 1723-1732, 1996.
69. M. Sudan, "Decoding of Reed-Solomon codes beyond the error-correction bound," Journal of Complexity, vol. 13, no. 1, pp. 180-193, 1997.
70. M. Sudan, "List decoding: Algorithms and applications," SIGACT News, vol. 31, pp. 16-27, 2000.
71. M. Sudan, "Ideal error-correcting codes: Unifying algebraic and number-theoretic algorithms," in Proceedings of AAECC-14: The 14th Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp. 36-45, November 2001.
72. A. Ta-Shma and D. Zuckerman, "Extractor codes," IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3015-3025, 2004.
73. L. Trevisan, "List-decoding using the XOR lemma," in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pp. 126-135, 2003.
74. L. Trevisan, "Some applications of coding theory in computational complexity," Quaderni di Matematica, vol. 13, pp. 347-424, 2004.
75. J. H. van Lint, "Introduction to coding theory," Graduate Texts in Mathematics, vol. 86, 3rd Edition, Springer-Verlag, Berlin, 1999.
76. J. von zur Gathen, Modern Computer Algebra. Cambridge University Press, 1999.
77. L. R. Welch and E. R. Berlekamp, "Error correction of algebraic block codes," US Patent Number 4,633,470, December 1986.
78. J. M. Wozencraft, "List decoding," Quarterly Progress Report, Research Laboratory of Electronics, MIT, vol. 48, pp. 90-95, 1958.
79. V. V. Zyablov and M. S. Pinsker, "List cascade decoding," Problems of Information Transmission, vol. 17, no. 4, pp. 29-34, (in Russian); pp. 236-240 (in English), 1982, 1981.