Robust multiplication-based tests for Reed-Muller codes

DOI10.4230/LIPICS.FSTTCS.2016.17MaRDI QIDQ4636564zbMATH OpenFDO

Authors Prahladh Harsha, Srikanth Srinivasan

Publication date 19 April 2018

Full work available at URL https://arxiv.org/abs/1612.03086

zbMATH Keywords

polynomials over finite fieldsSchwartz-Zippel lemmalow-degree testinglow-degree long code

Mathematics Subject Classification ID

Randomized algorithms (68W20) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Recommendations

• Optimal testing of Reed-Muller codes
• Testing low-degree polynomials over prime fields
• Testing Polynomials over General Fields
• Optimal testing of multivariate polynomials over small prime fields
• Testing Reed–Muller Codes

This page was built for publication: Robust multiplication-based tests for Reed-Muller codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636564)