Bounds on 2-query codeword testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 216-227

  Ben Sasson, Eli ^a   Goldreich, Oded ^b   Sudan, Madhu ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

BINARY ALPHABETS; CODE SIZE; CODE-WORDS; FINITE FIELDS; LINEAR CODES; MINIMAL DISTANCE; NON LINEAR; UPPER BOUND;

APPROXIMATION ALGORITHMS;

EID: 35248863469     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_19     Document Type: Article

References (9)

1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Intractability of Approximation Problems. Journal of the ACM, Vol. 45, pages 501-555, 1998.
2. M. Bellare, O. Goldreich and M. Sudan. Free Bits, PCPs and Non-Approximability - Towards Tight Results. SIAM Journal on Computing, Vol. 27, No. 3, pages 804-915, 1998.
3. E. Ben-Sasson, O. Goldreich and M. Sudan. Bounds on 2-Query Codeword Testing. ECCC, TR03-019, 2003.
4. E. Ben-Sasson, P. Harsha, S. Raskhodnikova. Some 3-CNF Properties are Hard to Test. In 35th STOC, 2003.
5. K. Friedl and M. Sudan. Some Improvements to Total Degree Tests. In Proc. of ISTCS, pages 190-198, 1995.
6. O. Goldreich, S. Goldwasser, D. Ron. Property Testing and its connection to Learning and Approximation. Journal of the ACM, 45(4):653-750, July 1998.
7. O. Goldreich and M. Sudan. Locally Testable Codes and PCPs of Almost-Linear Length. In 43rd FOCS, pages 13-22, 2002.
8. M. Kiwi. Probabilistically Checkable Proofs and the Testing of Hadamard-like Codes. Ph.D. Thesis, MIT, 1996.
9. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, Vol. 25 (2), pages 252-271, 1996.