Approximately list-decoding direct product codes and uniform hardness amplification

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2006, Pages 187-196

  Impagliazzo, Russell ^a   Jaiswal, Ragesh ^a   Kabanets, Valentine ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN ALGEBRA; ITERATIVE DECODING; PROBLEM SOLVING;

HADAMARD CODES; LENGTH STRING; N-BIT MESSAGE; PRODUCT ENCODING;

CODES (SYMBOLS);

EID: 38049164495     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2006.13     Document Type: Conference Paper

References (31)

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, 38:509-516, 1992.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the Association for Computing Machinery, 45(3):501-555, 1998. (preliminary version in FOCS'92).
3. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the Association for Computing Machinery, 45(1):70-122, 1998. (preliminary version in FOCS'92).
4. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993.
5. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average-case complexity. Journal of Computer and System Sciences, 44(2): 193-219, 1992.
6. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
7. I. Dinur. The PCP theorem by gap amplification. In Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pages 241-250, 2006.
8. O. Goldreich and L. A. Levin. A hard-core predicate for all one-way functions. In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pages 25-32, 1989.
9. O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR-Lemma. Electronic Colloquium on Computational Complexity, (TR95-050), 1995.
10. V. Guruswami and P. Indyk. Expander-based constructions of efficiently decodable codes. In Proceedings of the FortySecond Annual IEEE Symposium on Foundations of Computer Science, pages 658-667, 2001.
11. 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 Thirty-Fourth Annual ACM Symposium on Theory of Computing, pages 812-821, 2002.
12. V. Guruswami and P. Indyk. Linear-time encodable and list decodable codes. In Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pages 126-135, 2003.
13. A. Healy, S. Vadhan, and E. Viola. Using nondeterminism to amplify hardness. In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pages 192-201, 2004.
14. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of the Thirty-Sixth Annual IEEE Symposium on Foundations of Computer Science, pages 538-545, 1995.
15. R. Impagliazzo. Hardness as randomness: A survey of universal derandomization. In Proceedings of the ICM, volume 3, pages 659-672, 2002. (available online at arxiv.org/abs/cs.CC/0304040).
16. R. Impagliazzo and A. 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, 1997.
17. R. Impagliazzo and A. Wigderson. Randomness vs time: Derandomization under a uniform assumption. Journal of Computer and System Sciences, 63(4):672-688, 2001. (preliminary version in FOCS'98).
18. L. A. Levin. One-way functions and pseudorandom generators. Combinatorica, 7(4):357-363, 1987.
19. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
20. R. O'Donnell. Hardness amplification within NP. Journal of Computer and System Sciences, 69(1):68-94, 2004. (preliminary version in STOC'02).
21. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
22. O. Reingold, S. Vadhan, and A. Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders. Annals of Mathematics, 155(1): 157-187, 2002.
23. R. Shaltiel and C. Umans. Simple extractors for all minentropies and a new pseudo-random generator. In Proceedings of the Forty-Second Annual IEEE Symposium on Foundations of Computer Science, pages 648-657, 2001.
24. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62(2):236-266, 2001. (preliminary version in STOC'99).
25. L. Trevisan. Extractors and pseudorandom generators. Journal of the Association for Computing Machinery, 48(4):860-879, 2001. (preliminary version in STOC'99).
26. L. Trevisan. List-decoding using the XOR lemma. In Proceedings of the Forty-Fourth Annual IEEE Symposium on Foundations of Computer Science, pages 126-135, 2003.
27. L. Trevisan. Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:347-424, 2004.
28. L. Trevisan. On uniform amplification of hardness in NP. In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pages 31-38, 2005.
29. L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the Seventeenth Annual IEEE Conference on Computational Complexity, pages 103-112, 2002.
30. C. Umans. Pseudo-random generators for all hardnesses. Journal of Computer and System Sciences, 67(2):419-440, 2003. (preliminary version in STOC'02).
31. A.C. Yao. Theory and applications of trapdoor functions. In Proceedings of the Twenty-Third Annual IEEE Symposium on Foundations of Computer Science, pages 80-91, 1982.