Tolerant locally testable codes

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 306-317

  Guruswami, Venkatesan ^a   Rudra, Atri ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; ERROR CORRECTION; ERRORS; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY;

ERROR-CORRECTING CODES; LOCALLY TESTABLE CODES (LTCS); PARAMETER OPTIMIZATION; PROBABILITICALLY CHECKABLE CODES (PCC);

CODES (SYMBOLS);

EID: 26944493015     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_26     Document Type: Conference Paper

References (16)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the intractibility of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
3. L. Babai, A. Shpilka, and D. Stefankovic. Locally testable cyclic codes. In Proceedings of 44th Annual Symposium on Foundations of Computer Science (FOCS), pages 116-125, 2003.
4. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of proximity, shorter PCPs and application to coding. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pages 1-10, 2004.
5. E. Ben-Sasson and M. Sudan. Robust locally testable codes and products of codes. In Proceedings of the 8th International Workshop on Randomization and Computation (RANDOM), pages 286-297, 2004.
6. E. Ben-Sasson and M. Sudan. Simple PCPs with poly-log rate and query complexity. In Proceedings of 37th ACM Symposium on Theory of Computing (STOC), pages 266-275, 2005.
7. I. Dinur. The PCP theorem by gap amplification. In ECCC Technical Report TR05-046, 2005.
8. E. Fischer and L. Fortnow. Tolerant versus intolerant testing for boolean properties. In Proceedings of the 20th IEEE Conference on Computational Complexity, 2005. To appear.
9. K. Friedl and M. Sudan. Some improvements to total degree tests. In Proceedings of the 3rd Israel Symp. on Theory and Computing Systems (ISTCS), pages 190-198, 1995.
10. O. Goldreich. Short locally testable codes and proofs (Survey). ECCC Technical Report TR05-014, 2005.
11. O. Goldreich and M. Sudan. Locally testable codes and PCPs of almost linear length. In Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS), pages 13-22, 2002.
12. T. Kaufman and D. Ron. Testing polynomials over general fields. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 413-422, 2004.
13. M. Parnas, D. Ron, and R. Rubinfeld. Tolerant property testing and distance approximation. In ECCC Technical Report TR04-010, 2004.
14. A. Polishchuk and D. A. Spielman. Nearly-linear size holographic proofs. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), pages 194-203, 1994.
15. M. Sipser and D. Spielman. Expander codes. IEEE Transactions on Information Theory, 42(6):1710-1722, 1996.
16. M. Sudan. Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems. ACM Distinguished Theses Series. Lecture Notes in Computer Science, no. 1001, Springer, 1996.