Combinatorial construction of locally testable codes

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 285-294

  Meir, Or ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Theory

Indexed keywords

COMPUTATION THEORY; MACHINERY;

CODEWORD; ERROR CORRECTING CODE; LOCALLY TESTABLE CODES; THEORY;

CODES (SYMBOLS);

EID: 57049085865     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374419     Document Type: Conference Paper

References (19)

1. Noga Alon, Jehoshua Brack, Joseph Naor, Moni Naor, and R,on M. Roth. Construction of asymptotically good low rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, 38:509-516, 1992.
2. Sanjeev Arora, Carsten Lund, Rajeevi Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and intractability of approximation problems. Journal of ACM, 45(3):501-555, 1998. Preliminary version in FOCS 1992.
3. Sanjeev Arora and Shmuel Safra. Probabilistic checkable proofs: A new characterization of np. Journal of ACM volume, 45(1):70-122, 1998. Preliminary version in FOCS 1992.
4. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. Robust peps of proximity, shorter peps and applications to coding. SIAM Journal of Computing, 36(4): 120-134, 2006.
5. Eli Ben-Sasson and Madhu Sudan. Robust locally testable codes and products of codes. In APPROX-RANDOM, pages 286-297, 2004.
6. Eli Ben-Sasson and Madhu Sudan. Simple peps with poly-log rate and query complexity. In STOC, pages 266-275, 2005. Full version can be obtained from Eli Ben-Sasson's homepage at http://www.cs.technion.ac.il/~eli/.
7. Don Coppersmith and Atri R.udra. On the robust testability of tensor products of codes. Electronic Colloquium on Computational Complexity (ECCC), (104), 2005.
8. lilt Dinur. The pcp theorem by gap amplification. Journal of ACM, 54(3):241-250, 2007.
9. Irit Dinur and Omer R.eingold. Assignment testers: Towards combinatorial proof of the pcp theorem. SIAM Journal of Computing, 36(4):155-164, 2006.
10. Irit Dinur, Madhu Sudan, and Avi Wigderson. Robust local testability of tensor products of ldpc codes. In APPROX-RANDOM, pages 304-315, 2006.
11. Oded Goldreich. Short locally testable codes and proofs (survey). Electronic Colloquium on Computational Complexity (ECCC), (014), 2005.
12. Oded Goldreich and Or Meir. The tensor product of two good codes is not necessarily locally testable. Electronic Colloquium on Computational Complexity (ECCC), (062), 2007.
13. Oded Goldreich and Madhu Sudan. Locally testable codes and peps of almost linear length. Journal of ACM, 53(4):558-655, 2006. Preliminary version in FOCS 2002, pages 13-22.
14. Tali Kaufman and Madhu Sudan. Sparse random linear codes are locally decodable and testable. In FOCS, pages 590-600, 2007.
15. Or Meir, Combinatorial construction of locally testable codes. Electronic Colloquium on Computational Complexity (ECCC), (115), 2007.
16. Alexander Polishchuk and Daniel A. Spielman. Nearly-linear size holographic proofs. In STOC, pages 194-203, 1994.
17. Omer Reingold, Salil Vadhan, and Avi Wigderson. Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In FOCS, pages 3-13, 2000.
18. Madhu Sudan. Algorithmic introduction to coding theory (lecture notes), 2001. Available from http://theory.csail,mit.edu/~madhu/FT01/.
19. Paul Valiant. The tensor product of two codes is not necessarily robustly testable. In APPROX-RANDOM, pages 472-481, 2005.