249 search results - page 1 / 50 » Optimal Testing of Reed-Muller Codes |
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
FOCS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract. We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locall...
ECCC
2010
13 years 8 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
FOCS
2004
IEEE
14 years 7 days ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
DSD
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper, we propose an approach to the reduction of sizes of Multi-Terminal Binary Decision Diagrams (MTBDDs) [3] by using the copy properties of discrete functions. The und...