Robust Multiplication-based Tests for Reed-Muller Codes
Prahladh Harsha, Srikanth Srinivasan

TL;DR
This paper establishes the robust soundness of multiplication-based tests for Reed-Muller codes over finite fields, extending previous analyses to larger parameters and derandomized versions, with implications for coding theory and property testing.
Contribution
It proves the robust soundness of multiplication-based Reed-Muller tests for large parameters, extending prior work and analyzing derandomized variants, with a new finite field Schwartz-Zippel lemma.
Findings
Proved robust soundness for large e in multiplication tests.
Analyzed derandomized test variants with repeated polynomials.
Extended Schwartz-Zippel lemma over finite fields.
Abstract
We consider the following multiplication-based tests to check if a given function is a codeword of the Reed-Muller code of dimension and order over the finite field for prime (i.e., is the evaluation of a degree- polynomial over for prime). * : Pick independent random degree- polynomials and accept iff the function is the evaluation of a degree- polynomial (i.e., is a codeword of the Reed-Muller code of dimension and order ). We prove the robust soundness of the above tests for large values of , answering a question of Dinur and Guruswami [Israel Journal of Mathematics, 209:611-649, 2015]. Previous soundness analyses of these tests were known only for the case when either or . Even for the case and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
