Page
%P
-
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...
-
Chapter and Conference Paper
Absolutely Sound Testing of Lifted Codes
In this work we present a strong analysis of the testability of a broad, and to date the most interesting known, class of “affine-invariant” codes. Affine-invariant codes are codes whose coordinates are associ...