Sparse random linear codes are locally decodable and testable

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

Volumn , Issue , 2007, Pages 590-600

  Kaufman, Tali ^a   Sudan, Madhu ^b  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); COMPUTER SCIENCE; EIGENVALUES AND EIGENFUNCTIONS; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; KETONES; RANDOM PROCESSES;

(E ,3E) PROCESS; ALGEBRAIC CODES; BINARY LINEAR CODES; BLOCK LENGTHS; BOSE CHAUDHURI HOCQUENGHEM (BCH) CODES; CODE-WORDS; LINEAR ENCODING; ORTHOGONALITY; PROPERTY (S); RANDOM LINEAR CODES; TEST ABILITY;

CODES (SYMBOLS);

EID: 46749103721     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389528     Document Type: Conference Paper

References (15)

1. L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy. Checking computations in polylogarithmic time. STOC '91.
2. 1/(2k-1)) barrier for information-theoretic private information retrieval. FOCS '02.
3. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. STOC '04.
4. E. Ben-Sasson, O. Goldriech, P. Harsha, M. Sudan, and S. Vadhan. Short PCPs verifiable in poly logarithmic time. CCC '05.
5. E. Ben-Sasson and M. Sudan. Short PCPs with poly-log rate and query complexity. STOC '05.
6. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993.
7. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein. Covering Codes. North-Holland Mathematical Library, 54. North-Holland, Amsterdam, 1997.
8. I. Dinur. The PCP theorem by gap amplification. STOC '06.
9. O. Goldreich and M. Sudan. Locally testable codes and PCPs of almost-linear length. J. ACM 53(4):558-655, 2006.
10. J. Katz and L. Trevisan. On the efficiency of local decoding procedures for error-correcting codes. STOC '00.
11. T. Kaufman and S. Litsyn. Almost orthogonal linear codes are locally testable. FOCS '05.
12. T. Kaufman and M., Sudan. Sparse random linear codes are locally decodable and testable. ECCC Technical Report TR07-060.
13. I. Krasikov and S. Litsyn. On Binary Krawtchouk Polynomials, volume 56 of DIMACS series in Discrete Mathematics and Theoretical Computer Science, pages 199-212. American Mathematical Society, Providence, 2001.
14. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22(4):838-856, 1993.
15. S. Yekhanin. Towards 3-query locally decodable codes of subexponential length. STOC '07.