Robust Multiplication-Based Tests for Reed-Muller Codes

Authors Prahladh Harsha, Srikanth Srinivasan

Thumbnail PDF


  • Filesize: 0.53 MB
  • 14 pages

Document Identifiers

Author Details

Prahladh Harsha
Srikanth Srinivasan

Cite AsGet BibTex

Prahladh Harsha and Srikanth Srinivasan. Robust Multiplication-Based Tests for Reed-Muller Codes. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


We consider the following multiplication-based tests to check if a given function f: F^n_q -> F_q is the evaluation of a degree-d polynomial over F_q for q prime. Test_{e,k}: Pick P_1,...,P_k independent random degree-e polynomials and accept iff the function f P_1 ... P_k is the evaluation of a degree-(d + ek) polynomial. We prove the robust soundness of the above tests for large values of e, answering a question of Dinur and Guruswami (FOCS 2013). Previous soundness analyses of these tests were known only for the case when either e = 1 or k = 1. Even for the case k = 1 and e > 1, earlier soundness analyses were not robust. We also analyze a derandomized version of this test, where (for example) the polynomials P_1 ,... , P_k can be the same random polynomial P. This generalizes a result of Guruswami et al. (STOC 2014). One of the key ingredients that go into the proof of this robust soundness is an extension of the standard Schwartz-Zippel lemma over general finite fields F_q, which may be of independent interest.
  • Polynomials over finite fields
  • Schwartz-Zippel lemma
  • Low degree testing
  • Low degree long code


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, and Dana Ron. Testing Reed-Muller codes. IEEE Trans. Inform. Theory, 51(11):4032-4039, 2005. (Preliminary version in 7th RANDOM, 2003). URL:
  2. Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, and David Steurer. Making the long code shorter. SIAM J. Comput., 44(5):1287-1324, 2015. (Preliminary version in 53rd FOCS, 2012)., URL:
  3. Arnab Bhattacharyya, Swastik Kopparty, Grant Schoenebeck, Madhu Sudan, and David Zuckerman. Optimal testing of Reed-Muller codes. In Proc. 51st IEEE Symp. on Foundations of Comp. Science (FOCS), pages 488-497, 2010., URL:
  4. Irit Dinur and Venkatesan Guruswami. PCPs via the low-degree long code and hardness for constrained hypergraph coloring. Israel Journal of Mathematics, 209:611-649, 2015. (Preliminary version in 54th FOCS, 2013). URL:
  5. Venkat Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, and Girish Varma. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. In Proc. 46th ACM Symp. on Theory of Computing (STOC), pages 614-623, 2014., URL:
  6. Elad Haramaty, Amir Shpilka, and Madhu Sudan. Optimal testing of multivariate polynomials over small prime fields. SIAM J. Comput., 42(2):536-562, 2013. (Preliminary version in 52nd FOCS, 2011). URL:
  7. Sangxia Huang. 2^(log N)^1/10-o(1) hardness for hypergraph coloring. (manuscript), 2015. URL:
  8. Tadao Kasami, Shu Lin, and W. Wesley Peterson. Polynomial codes. IEEE Trans. Inform. Theory, 14(6):807-814, 1968. URL:
  9. Subhash Khot and Rishi Saket. Hardness of coloring 2-colorable 12-uniform hypergraphs with 2^(log n)^Ω(1) colors. In Proc. 55th IEEE Symp. on Foundations of Comp. Science (FOCS), pages 206-215, 2014. URL:
  10. Girish Varma. Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions. Chicago J. Theor. Comput. Sci., 2015(3):1-8, 2015., URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail