Testing Reed-Muller codes

IEEE Transactions on Information Theory

Volumn 51, Issue 11, 2005, Pages 4032-4039

  Alon, Noga ^a,b   Kaufman, Tali ^a   Krivelevich, Michael ^a   Litsyn, Simon ^a   Ron, Dana ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Affine subspaces; Binary field; Multivariate polynomials; Property testing; Reed Muller code

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; VECTORS;

AFFINE SUBSPACES; BINARY FIELD; MULTIVARIATE POLYNOMIALS; PROPERTY TESTING; REED-MULLER CODE;

CODES (SYMBOLS);

EID: 27744594919     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.856958     Document Type: Article

References (24)

1. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy, "Regular languages are testable with a constant number of queries," SIAM J. Comput., vol. 30, no. 6, pp. 1842-1862, 2001.
2. S. Arora, "Probabilistic checking of proofs and the hardness of approximation problems," Ph.D. dissertation, Univ. Calif. Berkeley, 1994.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and intractability of approximation problems," J. Assoc. Comput. Mach., vol. 45, no. 3, pp. 501-555, 1998.
4. S. Arora and S. Safra, "Probabilistic checkable proofs: A new characterization of NP," J. Assoc. Comput. Mach., vol. 45, no. 1, pp. 70-122, 1998.
5. S. Arora and M. Sudan, "Improved low-degree testing and its applications," in Proc. 29th Annu. ACM Symp. Theory of Computing, El Paso, TX, May 1997, pp. 485-495.
6. L. Babai, L. Fortnow, L. Levin, and M. Szegedy, "Checking computations in polylogarithmic time," in Proc. 23rd Annu. ACM Symp. Theory of Computing, New Orleans, LA, May 1991, pp. 21-31.
7. L. Babai, L. Fortnow, and C. Lund, "Non-deterministic exponential time has two-prover interactive protocols," Comput. Complexity, vol. 1, no. 1, pp. 340, 1991.
8. L. Babai, A. Shpilka, and D. Stefankovic, "Locally testable cyclic codes," in Proc. 44th Annu. Symp. Foundations of Computer Science, Cambridge, MA, Oct. 2003, pp. 116-125.
9. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan, "Linearity testing in characteristic two," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1781-1795, Nov. 1996.
10. M. Bellare, S. Goldwasser, C. Lund, and A. Russell, "Efficient probabilistically checkable proofs and applications to approximation," in Proc. 25th Annu. ACM Symp. Theory of Computing, San Diego, CA, May 1993, pp. 294-304.
11. M. Bellare and M. Sudan, "Improved nonapproximability results," in Proc. 26th Annu. ACM Symp. Theory of Computing, Montréal, QC, Canada, May 1994, pp. 184-193.
12. E. Ben-Sasson, P. Harsha, and S. Raskhodnikova, "Some 3CNF properties are hard to test," in Proc. 35th Annu. ACM Symp. Theory of Computing, San Diego, CA, Jun. 2003, pp. 345-354.
13. E. Ben-Sasson, M. Sudan, S. Vadhan, and A. Wigderson, "Randomness-efficient low degree tests and short PCPs via epsilon-biased sets," in Proc. 35th Annu. ACM Symp. Theory of Computing, San Diego, CA, Jun. 2003, pp. 612-621.
14. M. Blum, M. Luby, and R. Rubinfeld, "Self-testing/correcting with applications to numerical problems," J. Comput. Syst. Sci., vol. 47, pp. 549-595, 1993.
15. U.Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, "Approximating clique is almost NP-complete," J. Assoc. Comput. Mach., vol. 43, no. 2, pp. 268-292, Mar. 1996.
16. K. Friedl and M. Sudan, "Some improvements to total degree tests," in Proc. 3rd Annu. Israel Symp. Theory of Computing and Systems, Tel-Aviv, Israel, Jan. 1995, Corrected version available [Online] at http://theory.lcs.mit.edu/~madhulpapers/friedl.ps, pp. 190-198.
17. P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson, "Self-testing/correcting for polynomials and for approximate functions," in Proc. 23rd Annu. ACM Symp. Theory of Computing, New Orleans, LA, May 1991, pp. 32-42.
18. O. Goldreich and M. Sudan, "Locally testable codes and PCP's of almost-linear length," in Proc. 43rd Annu. Symp. Foundations of Computer Science, Vancouver, BC, Canada, Nov. 2002, pp. 13-22.
19. M. Hall, Combinatorial Theory. New York: Wiley, 1967.
20. C. S. Jutla, A. C. Patthak, A. Rudra, and D. Zuckerman, "Testing low-degree polynomials over prime fields," in Proc. 45th Annu. Symp. Foundations of Computer Science, Rome, Italy, Oct. 2004, pp. 423-432.
21. T. Kaufman and D. Ron, "Testing polynomials over general fields," in Proc. 45th Annu. Symp. Foundations of Computer Science, Rome, Italy, Oct. 2004, pp. 413-422.
22. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
23. R. Rubinfeld and M. Sudan, "Robust characterization of polynomials with applications to program testing," SIAM J. Comput., vol. 25, no. 2, pp. 252-271, 1996.
24. A. C. Yao, "Probabilistic computation, toward a unified measure of complexity," in Proc. 18th Annu. Symp. Foundations of Computer Science, Providence, RI, Oct./Nov. 1977, pp. 222-227.