List decoding: Algorithms and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1872 LNCS, Issue , 2000, Pages 25-41

  Sudan, Madhu ^a  

^a Department of Electrical Engineering and Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; ALGORITHMS; INFORMATION THEORY;

CODING THEORY; COMPLEXITY THEORY; ERROR CORRECTING CODE; LIST DECODING;

DECODING;

EID: 84879124452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44929-9_3     Document Type: Conference Paper

References (34)

1. Werner Alexi, Benny Chor, Oded Goldreich, and Claus P. Schnorr. RSA and Rabin functions: Certain parts are as hard as the whole. SIAM Journal on Computing, 17(2):194-209, April 1988.
2. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, and Madhu Sudan. Reconstructing algebraic functions from erroneous data. SIAM Journal on Computing, 28(2): 487-510, April 1999.
3. Sanjeev Arora and Madhu Sudan. Improved low degree testing and its applicati-ons. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 485-495, El Paso, Texas, 4-6 May 1997.
4. Laszlo Babai, Lance Fortnow, Noam Nisan, and Avi Wigderson. BPP has subexpo-nential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307-318, 1993.
5. Donald Beaver and Joan Feigenbaum. Hiding instances in multioracle queries. In 7th Annual Symposium on Theoretical Aspects of Computer Science, volume 415 of Lecture Notes in Computer Science, pages 37-48, Rouen, France, 22-24 February 1990. Springer.
6. Manuel Blum and Silvio Micali. How to generate cryptographically strong sequen-ces of pseudo-random bits. SIAM Journal on Computing, 13(4):850-864, November 1984.
7. Dan Boneh. Finding smooth integers in short intervals using CRT decoding. (To appear) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, Oregon, 21-23 May 2000.
8. Jin-Yi Cai, A. Pavan, and D. Sivakumar. On the hardness of the permanent. In 16th International Symposium on Theoretical Aspects of Computer Science, Lec-ture Notes in Computer Science, Trier, Germany, March 4-6 1999. Springer-Verlag.
9. Peter Elias. List decoding for noisy channels. In 1957-IRE WESCON Convention Record, Pt. 2, pages 94-104, 1957.
10. Joan Feigenbaum. The use of coding theory in computational complexity. In Proceedings of Symposia in Applied Mathematics, R. Calderbank (ed.), American Mathematics Society, Providence, pages 203-229, 1995.
11. Anna Gal, Shai Halevi, Richard Lipton, and Erez Petrank. Computing from partial solutions In Proceedings of the Fourteenth Annual IEEE Conference on Computa-tional Complexity, Atlanta, Georgia, 4-6 May 1999.
12. Oded Goldreich and Leonid A. Levin. A hard-core predicate for all one-way func-tions. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 25-32, Seattle, Washington, 15-17 May 1989.
13. Oded Goldreich, Ronitt Rubinfeld, and Madhu Sudan. Learning polynomials with queries|the highly noisy case. Technical Report TR98-060, Electronic Colloquium on Computational Complexity, 1998. Preliminary version in FOCS '95.
14. Oded Goldreich, Dana Ron, and Madhu Sudan. Chinese remaindering with errors. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 225-234, Atlanta, Georgia, 1-4 May 1999.
15. Venkatesan Guruswami, Johan Hastad, Madhu Sudan, and David Zuckerman. Un-titled Manuscript, January 2000.
16. Venkatesan Guruswami, Amit Sahai, and Madhu Sudan. Untitled Manuscript, January 2000.
17. Venkatesan Guruswami and Madhu Sudan. Improved decoding of Reed-Solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45(6): 1757-1767, September 1999.
18. Venkatesan Guruswami and Madhu Sudan, Low-rate codes with high error cor-rection capabilities. (To appear) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, Oregon, 21-23 May 2000.
19. Russell Impagliazzo. Personal Communication, July 1997.
20. Russell Impagliazzo. Hard-core distributions for somewhat hard problems. In 36th Annual Symposium on Foundations of Computer Science, pages 538-545, Milwau-kee, Wisconsin, 23-25 October 1995. IEEE.
21. Russell Impagliazzo, Ronen Shaltiel, and Avi Wigderson. Near-optimal conversion of hardness into pseudo-randomness. In Proceedings of the Thirty-Ninth Annual IEEE Symposium on Foundations of Computer Science, New York City, New York, 17-19 October 1999. (To appear.)
22. Russell Impagliazzo and Avi Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 220-229, El Paso, Texas, 4-6 May 1997.
23. Erich Kaltofen. Polynomial factorization 1987-1991. In I. Simon, editor, Proc. LA-TIN '92, volume 583 of Lect. Notes Comput. Sci., pages 294-313, Heidelberg, Ger-many, 1992. Springer Verlag.
24. S. Ravi Kumar and D. Sivakumar. Proofs, codes, and polynomial-time reducibili-ties. In Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, 4-6 May 1999.
25. Richard Lipton. New directions in testing. In Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, 1989.
26. Noam Nisan and Avi Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2):149-167, October 1994.
27. Vera Pless, W. Cary Human, and Richard A. Brualdi (Eds.). Handbook of Coding Theory, North-Holland, 1998.
28. Ran Raz, Omer Reingold, and Salil Vadhan. Extracting all the randomness and reducing the error in Trevisan's extractors. In Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, Atlanta, GA, May 1999.
29. M. Amin Shokrollahi and Hal Wasserman. List decoding of algebraic-geometric codes IEEE Transactions on Information Theory, 45:432-437, March 1999.
30. D. Sivakumar. On membership comparable sets. Journal of Computer and System Sciences, 59(2): 270-280, October 1999.
31. Madhu Sudan. Decoding of Reed Solomon codes beyond the error-correction bo-und. Journal of Complexity, 13(1):180-193, March 1997.
32. Madhu Sudan, Luca Trevisan, and Salil Vadhan. Pseudorandom generators without the XOR lemma [extended abstract]. In Proceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, pages 537-546, Atlanta, Georgia, 1-4 May 1999.
33. Amnon Ta-Shma and David Zuckerman. Personal communication, November 1999.
34. Luca Trevisan. Construction of extractors using pseudorandom generators. In Pro-ceedings of the Thirty-First Annual ACM Symposium on the Theory of Computing, Atlanta, Georgia, 1-4 May 1999.