Testing low-degree polynomials over prime fields

Random Structures and Algorithms

Volumn 35, Issue 2, 2009, Pages 163-193

  Jutla, Charanjit S ^a   Patthak, Anindya C ^b   Rudra, Atri ^c   Zuckerman, David ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c the State University of New York   (United States)

^d University of Texas at Austin   (United States)

Author keywords

Generalized Reed Muller code; Local correction; Local testing; Polynomials

Indexed keywords

EID: 68349133177     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20262     Document Type: Article

References (24)

1. E. F. Assumus Jr. and J. D. Key, Polynomial codes and Finite Geometries in Handbook of Coding Theory, V. S. Pless Jr. and W. C. Huffman (Editors), Vol. II, Chapter 16, Elsevier, 1998, pp. 1269-1344.
2. N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn, and D. Ron, Testing Reed-Muller codes, IEEE Trans Inf Theory 51 (2005), 4032-4039 (Preliminary version "Testing Low-Degree Polynomials over GF(2)" appeared in RANDOM 2003).
3. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy, Regular languages are testable with a constant number of queries, In Proceedings of Fortieth Annual Symposium on Foundations of Computer Science, 1999, pp. 645-655.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the intractibility of approximation problems, J ACM 45 (1998), 501-555.
5. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, J ACM 45 (1998), 70-122.
6. S. Arora and M. Sudan, Improved low-degree testing and its applications, Combinatorica 23 (2003), 365-426.
7. L. Babai, L. Fortnow, and C. Lund, Non-deterministic exponential time has two prover interactive protocols, Computational Complexity 1 (1991), 3-40.
8. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, Checking computations in polylogarithmic time, In Proceedings of Symposium on the Theory of Computing, 1991, pp. 21-31.
9. M. Blum, M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J Comput Syst Sci 47 (1993), 549-595.
10. E. Ben-Sasson, P. Harsha, and S. Raskhodnikova, Some 3CNF properties are hard to test, SIAM J Comput 35 (2005), 1-21.
11. E. Ben-Sasson and M. Sudan, Robust locally testable codes and products of codes, Random Struct Algorithms 28 (2006), 387-402.
12. S. D. Cohen, Functions and polynomials in vector spaces, Archiv der Mathematik IT-14 (1987), 409-419.
13. P. Delsarte, On cyclic codes that are invariant under the general linear group, IEEE Trans Inf Theory 16 (1970), 760-769.
14. P. Delsarte, J. M. Goethals, and F. J. MacWillams, On generalized Reed-Muller codes and their relatives, Inf Control 16 (1970), 403-442.
15. P. Ding and J. D. Key, Minimum-weight codewords as generators of generalized Reed-Muller codes, IEEE Trans Inf Theory 46 (2000), 2152-2158.
16. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Interactive proofs and the hardness of approximating cliques, J ACM 43 (1996), 268-292.
17. 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, 1995, pp. 190-198 Corrected version available at: http://theory.lcs.mit.edu/~madhu/papers/friedl.ps.
18. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, Self-testing/correcting for polynomials and for approxiamte functions, In Proceedings of Symposium on the Theory of Computing, 1991.
19. V. Guruswami and A. Rudra, Tolerant locally testable codes, In Proceedings of the 9th International Workshop on Randomization and Computation (RANDOM), 2005, pp. 306-317.
20. C. S. Jutla, A. C. Patthak, and A. Rudra, Testing polynomials over general fields, personal manuscript, 2004.
21. T. Kaufman and D. Ron, Testing polynomials over general fields, SIAM J Comput 36 (2006), 779-802.
22. A. C. Patthak, Error-correcting Codes: Local Testing, List Decoding, and Applications, PhD thesis, University of Texas at Austin, Austin, 2007.
23. R. Rubinfeld and M. Sudan, Robust characterizations of polynomials with applications to program testing, SIAM J Comput 25 (1996), 252-271.
24. M. Sudan, Lecture notes on algorithmic introduction to coding theory, Fall 2001, Lecture 15.