List-decoding reed-muller codes over small fields
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Succinct Representation of Codes with Applications to Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Testing Computability by Width Two OBDDs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
On the structure of cubic and quartic polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
Guest column: testing linear properties: some general theme
ACM SIGACT News
The program of the mini-workshop
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Invariance in property testing
Property testing
Testing linear-invariant non-linear properties: a short report
Property testing
Optimal Testing of Reed-Muller Code
Property testing
The program of the mini-workshop
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Invariance in property testing
Property testing
Testing linear-invariant non-linear properties: a short report
Property testing
Optimal Testing of Reed-Muller Code
Property testing
Symmetric LDPC codes and local testing
Property testing
On sums of locally testable affine invariant properties
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Limits on the rate of locally testable affine-invariant codes
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Information Processing Letters
Testing computability by width-two OBDDs
Theoretical Computer Science
Towards an optimal query efficient PCP?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 754.84 |
A code is locally testable if there is a way to indicate with high probability that a vector is far enough from any codeword by accessing only a very small number of the vector's bits. We show that the Reed-Muller codes of constant order are locally testable. Specifically, we describe an efficient randomized algorithm to test if a given vector of length n=2m is a word in the rth-order Reed-Muller code R(r,m) of length n=2m. For a given integer r≥1, and real ε0, the algorithm queries the input vector υ at O(1/ε+r22r) positions. On the one hand, if υ is at distance at least εn from the closest codeword, then the algorithm discovers it with probability at least 2/3. On the other hand, if υ is a codeword, then it always passes the test. Our result is almost tight: any algorithm for testing R(r,m) must perform Ω(1/ε+2r) queries.