1 paper
Swastik Kopparty, Mrinal Kumar, Harry Sha
The classical Reed-Muller codes over a finite field Fq are based on evaluations of m-variate polynomials of degree at most d over a product set Um, for some d…