Locally testable cyclic codes

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

Volumn 2003-January, Issue , 2003, Pages 116-125

  Babai, L ^a,b   Shpilka, A ^c,d   Stefankovic D ^a,e  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c HARVARD UNIVERSITY   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e Physics and Informatics   (Slovakia)

Author keywords

Computer science; Testing

Indexed keywords

CODES (SYMBOLS); COMPUTER SCIENCE; HAMMING DISTANCE; TESTING;

BLOCK LENGTHS; CONSTANT RATE; CYCLIC CODE; CYCLIC SHIFTS; FINITE FIELDS; LINEAR CODES; LINEAR SUBSPACE; RANDOMIZED ALGORITHMS;

C (PROGRAMMING LANGUAGE);

EID: 17744386581     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238186     Document Type: Conference Paper

References (23)

1. N. ALON, J.H. SPENCER: The Probabilistic Method. Wiley 1992.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, M. SZEGEDY: Proof Verification and Intractability of Approximation Problems. J. ACM 45 (1998), 501-555.
3. S. ARORA, M. SAFRA: Probabilistically Checkable Proofs: A New Characterization of NP. J. ACM 45 (1998), 70-122.
4. L. BABAI, P. ERDO{combining double acute accent}S: Representation of Group elements as short products. In: "Theory and Practice of Combinatorics" (A. Rosa, G. Sabidussi, J. Turgeon eds.) Annals of Discrete Math. 12 (1982), 27-30.
5. L. BABAI, L. FORTNOW, C. LUND: Nondeterministic exponential time has two-prover interactive protocols. Computational Complexity 1 (1991), 3-40.
6. L. BABAI, L. FORTNOW, L. A. LEVIN, M. SZEGEDY: Checking computations in poly-logarithmic time. 23rd ACM STOC, 1991, pp. 21-31.
7. E. BACH, J. SHALLIT: Algorithmic Number Theory. MIT Press, 1996.
8. E. BEN SASSON, O. GOLDREICH, M. SUDAN: Bounds on 2-Query Codeword Testing. ECCC Report TR03-019 (2003).
9. E. BEN SASSON, M. SUDAN, S. VADHAN, A. WIGDERSON: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. 35th ACM STOC, 2003, pp. 612-621.
10. S. D. BERMAN: Semisimple Cyclic and Abelian Codes. Cybernetics 3 (1967), 21-30.
11. M. BLUM, M. LUBY, R. RUBINFELD: Self-Testing/Correcting with Application to Numerical Problems. JCSS 47(3) (1993), 549-595.
12. G. CASTAGNOLI, J. L. MASSEY, P. A. SCHOELLER, N. VON SEEMAN: On Repeated-Root Cyclic Codes. IEEE Transactions on Information Theory, 37(2) (1991), 337-342.
13. R. CRANDALL, K. DILCHER, C. POMERANCE: A search for Wieferich and Wilson primes. Math. Comp. 66 (1997), 433-449.
14. A. DESHPANDE, R. JAIN, T. KAVITHA, S. V. LOKAM, J. RADHAKRISHNAN: Better lower bounds for locally decodable codes. 17th IEEE Conf. on Computational Complexity, 2002, pp. 152-161.
15. K. FRIEDL, M. SUDAN: Some improvements to total degree tests. 3rd Ann. Israel Symp. on Theory of Computing and Systems, Tel Aviv, Israel, 4-6 January 1995, pp. 190-198.
16. O. GOLDREICH, H. KARLOFF, L. SCHULMAN, L. TREVISAN: Lower Bounds for Linear Locally Decodable Codes and Private Information Retrieval. 17th IEEE Conference on Computational Complexity, 2002, pp. 175-183.
17. O. GOLDREICH, M. SUDAN: Locally testable codes and PCPs of almost linear length. 43rd IEEE FOCS, 2002, pp. 13-22.
18. J. KATZ, L. TREVISAN: On the efficiency of local decoding procedures for error-correcting codes. 32nd ACM STOC, 2000, pp. 80-86.
19. I. KERENIDIS, R. DE WOLF: Exponential lower bound for 2-query locally decodable codes via a quantum argument. 35th ACM STOC, 2003, pp. 106-115.
20. R. LIDL, H. NIEDERREITER: Finite Fields. Encyclopedia of Mathematics and its applications, vol. 20, Cambridge University Press, 1997.
21. F. J. MACWILLIAMS, N. J. A. SLOANE: The Theory of Error-Correcting Codes. North-Holland - Elsevier, Amsterdam 1977.
22. E. PRANGE: Cyclic Error-Correcting codes in two symbols. Technical report AFCRC-TN-57-103, Air Force Cambridge Research Center, Cambridge, Mass. 1957.
23. A. WIEFERICH: Zum letzten Fermat'chen Theorem. J. Reine Angew. Math. 136 (1909), 293-302.