Locally testable cyclic codes

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 116-125

  Babai, László ^a,b   Shpilka, Amir ^c,d   Štefankovič, Daniel ^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

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECODING; POLYNOMIALS; RANDOM PROCESSES; THEOREM PROVING;

CYCLIC CODES; HOLOGRAPHIC PROOFS; LINEAR CODES; RANDOMIZED ALGORITHM;

BLOCK CODES;

EID: 0344118897     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     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. Erdö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 polylogarithmic 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. Rubinfield: 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'schen Theorem. J. Reine Angew. Math. 136 (1909), 293-302.