Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Probabilistic Bounds on the Extremal Eigenvalues and Condition Number by the Lanczos Algorithm
SIAM Journal on Matrix Analysis and Applications
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Reconstructing Algebraic Functions from Mixed Data
SIAM Journal on Computing
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Complexity of Error-Correcting Codes
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Linear time erasure codes with nearly optimal recovery
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Expander-Based Constructions of Efficiently Decodable Codes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Computationally efficient error-correcting codes and holographic proofs
Computationally efficient error-correcting codes and holographic proofs
List decoding of error-correcting codes
List decoding of error-correcting codes
Noisy polynomial interpolation and noisy chinese remaindering
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Linear-time encodable and decodable error-correcting codes
IEEE Transactions on Information Theory - Part 1
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory
Guest column: error-correcting codes and expander graphs
ACM SIGACT News
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Linear time decoding of regular expander codes
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Hardness amplification via space-efficient direct products
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Linear-time decoding of regular expander codes
ACM Transactions on Computation Theory (TOCT) - Special issue on innovations in theoretical computer science 2012
Hi-index | 0.00 |
We present the first construction of error-correcting codes which can be (list) decoded from a noise fraction arbitrarily close to 1 in linear time. Specifically, we present an explicit construction of codes which can be encoded in linear time as well as list decoded in linear time from a fraction (1-ε) of errors for arbitrary ε 0. The rate and alphabet size of the construction are constants that depend only on ε. Our construction involves devising a new combinatorial approach to list decoding, in contrast to all previous approaches which relied on the power of decoding algorithms for algebraic codes like Reed-Solomon codes.Our result implies that it is possible to have, and in fact explicitly specifies, a coding scheme for arbitrarily large noise thresholds with only constant redundancy in the encoding and constant amount of work (at both the sending and receiving ends) for each bit of information to be communicated. Such a result was known for certain probabilistic error models, and here we show that this is possible under the stronger adversarial noise model as well.