Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes

    Over a finite field \({\mathbb{F}}_q\) the (n,d,q)-Reed-Muller code is the code given by evaluations of n-variate polyn...

    Noga Ron-Zewi, Madhu Sudan in Approximation, Randomization, and Combinat… (2012)