Almost orthogonal linear codes are locally testable

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

Volumn 2005, Issue , 2005, Pages 317-326

  Kaufman, Tali ^a   Litsyn, Simon ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; QUERY LANGUAGES; VECTORS;

DUAL CODES; GOPPA CODES; ORTHOGONAL LINEAR CODES; WEIGHT DISTRIBUTION;

CODES (SYMBOLS);

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

References (39)

1. N. Alon. Explicit Ramsey graphs and orthonormal labelings The Electronic J. Combinatorics 1, 1994, R12.
2. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost k-wise independent random variables Random Structures and Algorithms 3:289304, 1992.
3. N. Alon, M. Krivelevich, T. Kaufman, S. Litsyn, and D. Ron. Testing low-degree polynomials over GF(2). In Proceedings of the Seventh Annual Workshop on Randomization and Approximation Techniques in Computer Sciences (RANDOM), pages 188-199, 2003.
4. S. Arora. Probabilistic checking of proofs and the hardness of approximation problems. PhD thesis, UC Berkeley, 1994.
5. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. JACM, 45(3):501-555, 1998.
6. S. Arora and S. Safra. Probabilistic checkable proofs: A new characterization of NP. JACM, 45(1):70-122, 1998.
7. S. Arora and M. Sudan. Improved low-degree testing and its applications. In Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pages 485-495, 1997.
8. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
9. L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pages 21-31, 1991.
10. L. Babai, A. Shpilka, and D. Stefankovic. Locally testable cyclic codes. In Proceedings of the Forty-forth Annual Symposium on Foundations of Computer Science, pages 116-125, 2003.
11. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan. Linearity testing in characteristic two. IEEE Trans. Inform. Theory, 42:1781-1795, 1996.
12. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 294-304, 1993.
13. M. Bellare and M. Sudan. Improved nonapproximability results. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 184-193, 1994.
14. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proceedings of the Thirty-Sixth Annual ACM Symposium on the Theory of Computing, pages 1-10, 2004.
15. E. Ben-Sasson, P. Harsha, and S. Raskhodnikova. Some 3CNF properties are hard to test. In Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, pages 345-354, 2003.
16. E. Ben-Sasson, M. Sudan, S. Vadhan, and A. Wigderson. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In Proceedings of the Thirty-Fifth Annual ACM Symposium on the Theory of Computing, pages 612-621, 2003.
17. E. R. Berlekamp Goppa codes IEEE Transaction on Information Theory, 19:590-592, 1973.
18. E. R. Berlekamp Ch. 7 in Algorithmic Coding Theory New York: McGraw-Hill, 1968.
19. M. Blum, M. Luby, and R. Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47:549-595, 1993.
20. G. Cohen, I. Honkala, S.Litsyn, A. Lobstein Covering Codes. North Holland, 1997.
21. D. G. Cantor and H. Zassenhaus. A new algorithm for factoring polynomails over finite fields. Mathematics of Computation, 36: 587-592, 1981.
22. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Approximating clique is almost NPcomplete. Journal of the Association for Computing Machinery, pages 268-292, 1996.
23. K. Friedl and M. Sudan. Some improvements to total degree tests. In Proceedings of the 3rd Annual Israel Symposium on Theory of Computing and Systems, pages 190-198, 1995. Corrected version available online at http://theory.lcs.mit.edu/~madhu/papers/friedl.ps.
24. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approximate functions. In Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pages 32-42, 1991.
25. O. Goldreich. Short Locally Testable Codes and Proofs(survey). Available online at http://www.wisdom.weizmann.ac.il/~oded.
26. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. Journal of the Association for Computing Machinery, 45(4):653-750, 1998.
27. O. Goldreich and M. Sudan. Locally testable codes and PCPs of almost-linear length. In Proceedings of the Forty-Third Annual Symposium on Foundations of Computer Science, pages 13-22, 2002.
28. C. S. Jutla, A. C. Patthak, A. Rudra, and D. Zuckerman. Testing low-degree polynomials over prime fields. Proceedings of the Forty-Fifth Annual Symposium on Foundations of Computer Science, pages 423-432, 2004.
29. T. Kaufman and D. Ron. Testing polynomials over general fields. Proceedings of the Forty-Fifth Annual Symposium on Foundations of Computer Science, pages 413-422, 2004.
30. S. Khot. Hardness of approximating the shortest vector problem in lattices Proceedings of the Forty-Fifth Annual Symposium on Foundations of Computer Science, pages 126-135, 2004.
31. M. Kiwi. Algebraic testing and weight distributions of codes Theoretical Computer Science, 299, pages 81-106, 2003.
32. I. Krasikov and S. Litsyn On Spectra of BCH Codes. IEEE Transaction on Information Theory, 41(3):786-788, 1995.
33. I. Krasikov and S. Litsyn Survey of binary Krawtchouk polynomials DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 56, 2001.
34. V. I. Levenshtein. Handbook of Coding Theory, Volume 1, Chapter 9. North Holland, 1977.
35. F. J. MacWilliams and N. J. A. Sloane. The Theory of Error Correcting Codes. North Holland, 1977.
36. A. W. Marshall, and I. Olkin. Inequalities: Theory of Majorization and its Applications. Academic Press, New York, 1979.
37. J. L. Massey Shift-Register Synthesis and BCH Decoding IEEE Transaction on Information Theory,15, 122-127, 1969.
38. R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
39. L. Trevisan. Some Applications of Coding Theory in Computational Complexity Quaderni di Matematica 13:347-424, 2004.