The tensor product of two codes is not necessarily robustly testable

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 472-481

  Valiant, Paul ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; POLYNOMIALS; PROBES; RANDOM PROCESSES; TENSORS;

CONSTRUCTING CODES; RANDOM PROBES; TENSOR PRODUCTS; TESTABILITY PROPERTIES;

CODES (SYMBOLS);

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

References (13)

1. Sanjeev Arora. Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, University of California at Berkeley, 1994.
2. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, May 1998.
3. Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, January 1998.
4. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 1-10, 2004.
5. E. Ben-Sasson and M. Sudan. Robust Locally Testable Codes and Products of Codes. RANDOM 2004, pages 286-297, 2004.
6. E. Ben-Sasson and M. Sudan. Simple PCPs with Poly-log Rate and Query Complexity. 37th STOC (to appear), 2005.
7. Katalin Friedl and Madhu Sudan. Some improvements to total degree tests. In Proceedings of the 3rd Annual Israel Symposium on Theory of Computing and Systems, pages 190-198, Tel Aviv, Israel, 4-6 January 1995. Corrected version available online at http://theory.csail.mit.edu/~madhu/papers/friedl.ps.
8. Oded Goldreich and Madhu Sudan. Locally testable codes and PCPs of almost-linear length. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, 16-19 November 2002.
9. F. J. MacWilliams and Neil J. A. Sloane. The Theory of Error-Correcting Codes. Elsevier/North-Holland, Amsterdam, 1981.
10. Alexander Polishchuk and Daniel A. Spielman. Nearly linear-size holographic proofs. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 194-203, Montreal, Quebec, Canada, 23-25 May 1994.
11. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, April 1996.
12. Ran Raz and Shmuel Safra. A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. In Proceedings of the 29th STOC, pages 475-484, 1997.
13. Madhu Sudan. Algorithmic introduction to coding theory. Lecture notes, Available from http://theory.csail.mit.edu/~madhu/FT01/, 2001.