List-decoding using the XOR lemma

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

Volumn 2003-January, Issue , 2003, Pages 126-135

  Trevisan, L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Boolean functions; Code standards; Complexity theory; Computer science; Decoding; Distributed computing; Encoding; Error correction codes

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; ENCODING (SYMBOLS); ERROR CORRECTION; ERRORS;

COMPLEXITY THEORY; DECODING ALGORITHM; DIRECT PRODUCT; ENCODING TIME; ERROR CORRECTING CODE; ERROR CORRECTION CODES; HARD CORES; LIST DECODING;

DECODING;

EID: 84943382380     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238187     Document Type: Conference Paper

References (19)

1. M. Alekhnovich. Linear diophantine equations over polynomials and soft decoding of reed-solomon codes. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pages 439-448, 2002.
2. 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, 28:509-516, 1992.
3. 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.
4. G. Feng. Two fast algorithms in the sudan decoding procedure. In Proceedings of the 37th Allerton Conference, pages 545-554, 1999.
5. O. Gabber and Z. Galil. Explicit construction of linear sized superconcentrators. Journal of Computer and System Sciences, 22:407-425, 1981.
6. O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR lemma. Technical Report TR95-50, Electronic Colloquium on Computational Complexity, 1995.
7. V. Guruswami and P. Indyk. Expander-based constructions of efficiently decodable codes. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 658-667, 2001.
8. V. Guruswami and P. Indyk. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smalle alphabets. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 812-821, 2002.
9. V. Guruswami and P. Indyk. Linear time encodable and list decodable codes. In Proceedings of the 35th ACM Symposium on Theory of Computing, 2003.
10. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pages 538-545, 1995.
11. R. Impagliazzo and A. Wigderson. P = BPP unless E has sub-exponential circuits. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 220-229, 1997.
12. L. Levin. One-way functions and pseudorandom generators. Combinatorica, 7(4):357-363, 1987.
13. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8:261-277, 1988.
14. R. O'Donnell. Hardness amplification within np. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 751-760, 2002.
15. M. Sipser and D. Spielman. Expander codes. IEEE Transactions on Information Theory, 42(6):1710-1722, 1996. Preliminary version in Proc. of FOCS'94.
16. M. Sudan. Decoding of Reed-Solomon codes beyond the error-correction bound. Journal of Complexity, 13(1):180-193, 1997. Preliminary version in Proc. of FOCS'96.
17. M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62(2):236-266, 2001.
18. L. Trevisan. List decoding using the XOR lemma. Technical Report TR03-042, Electronic Colloquium on Computational Complexity, 2003.
19. L. Trevisan and S. Vadhan. Pseudorandomness and average-case complexity via uniform reductions. In Proceedings of the 17th IEEE Conference on Computational Complexity, pages 129-138, 2002.