A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
List decoding: algorithms and applications
ACM SIGACT News
Learning Polynomials with Queries: The Highly Noisy Case
SIAM Journal on Discrete Mathematics
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
List-Decoding Using The XOR Lemma
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Proving Hard-Core Predicates Using List Decoding
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Decoding of Reed-Muller codes with polylogarithmic complexity
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)
Low-degree tests at large distances
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Pseudorandom Bits for Polynomials
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Noisy Interpolating Sets for Low Degree Polynomials
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
List decoding of q-ary Reed-Muller codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
List decoding tensor products and interleaved codes
Proceedings of the forty-first annual ACM symposium on Theory of computing
List Decoding of Binary Codes---A Brief Survey of Some Recent Results
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Random Low Degree Polynomials are Hard to Approximate
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
Some recent results on local testing of sparse linear codes
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
List Decoding Tensor Products and Interleaved Codes
SIAM Journal on Computing
On the list decodability of random linear codes with large error rates
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We present the first local list-decoding algorithm for the rth order Reed-Muller code RM(2,m) over F for r ≥ 2. Given an oracle for a received word R: Fm --r - ε) from R for any ε r,ε-r). The list size could be exponential in m at radius 2-r, so our bound is optimal in the local setting. Since RM(2,m) has relative distance 2-r, our algorithm beats the Johnson bound for r ≥ 2. In the setting where we are allowed running-time polynomial in the block-length, we show that list-decoding is possible up to even larger radii, beyond the minimum distance. We give a deterministic list-decoder that works at error rate below J(21-r), where J(δ) denotes the Johnson radius for minimum distance δ. This shows that RM(2,m) codes are list-decodable up to radius η for any constant η q, we present list-decoding algorithms in both the global and local settings that work up to the list-decoding radius. We conjecture that the list-decoding radius approaches the minimum distance (like over F), and prove this holds true when the degree is divisible by q-1.