How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Reconstructing Algebraic Functions from Mixed Data
SIAM Journal on Computing
Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Finding smooth integers in short intervals using CRT decoding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Handbook of Coding Theory
Polynomial Factorization 1987-1991
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Computing From Partial Solutions
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Proofs, Codes, and Polynomial-Time Reducibilities
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Learning polynomials with queries: The highly noisy case
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
List decoding of algebraic-geometric codes
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Towards coding for maximum errors in interactive communication
Proceedings of the forty-third annual ACM symposium on Theory of 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 |
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of "list-decoding" for error-correcting codes. In this survey we describe the list-decoding problem, the algorithms that have been developed, and a diverse collection of applications within complexity theory.