Introduction to finite fields and their applications
Introduction to finite fields and their applications
Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Highly resilient correctors for polynomials
Information Processing Letters
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Reconstructing Algebraic Functions from Mixed Data
SIAM Journal on Computing
Modern computer algebra
List decoding algorithms for certain concatenated codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Finding smooth integers in short intervals using CRT decoding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
List decoding: algorithms and applications
ACM SIGACT News
Learning Polynomials with Queries: The Highly Noisy Case
SIAM Journal on Discrete Mathematics
Limits to list decodability of linear codes
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Introduction to Coding Theory
Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A New Approach To Information Theory
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Linear time encodable and list decodable codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Reconstructing curves in three (and higher) dimensional space from noisy data
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Learning polynomials with queries: The highly noisy case
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
"Soft-decision" decoding of Chinese remainder codes
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Decoding Concatenated Codes using Soft Information
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Expander-Based Constructions of Efficiently Decodable Codes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
List-Decoding Using The XOR Lemma
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Better extractors for better codes?
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Guest column: error-correcting codes and expander graphs
ACM SIGACT News
Private Codes or Succinct Random Codes That Are (Almost) Perfect
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Code bounds for multiple packings over a nonbinary finite alphabet
Problems of Information Transmission
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Explicit capacity-achieving list-decodable codes
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Decoding of interleaved Reed Solomon codes over noisy data
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A lower bound on list size for list decoding
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Optimal error correction against computationally bounded noise
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
IEEE Transactions on Information Theory - Part 1
Linear-time encodable and decodable error-correcting codes
IEEE Transactions on Information Theory - Part 1
A linear time erasure-resilient code with nearly optimal recovery
IEEE Transactions on Information Theory - Part 1
Reliable communication under channel uncertainty
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Chinese remaindering with errors
IEEE Transactions on Information Theory
On representations of algebraic-geometry codes
IEEE Transactions on Information Theory
Combinatorial bounds for list decoding
IEEE Transactions on Information Theory
Hardness of approximating the minimum distance of a linear code
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
List decoding from erasures: bounds and code constructions
IEEE Transactions on Information Theory
Reed-Solomon codes for correcting phased error bursts
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Linear-time encodable/decodable codes with near-optimal rate
IEEE Transactions on Information Theory
Limits to List Decoding Reed–Solomon Codes
IEEE Transactions on Information Theory
The unified theory of pseudorandomness: guest column
ACM SIGACT News
List-decoding reed-muller codes over small fields
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
List decoding tensor products and interleaved codes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Limits to List Decoding Random Codes
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Algorithms and theory of computation handbook
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Optimal rate list decoding via derivative codes
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
List Decoding Tensor Products and Interleaved Codes
SIAM Journal on Computing
A coding-theoretic approach to recovering noisy RSA keys
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Hi-index | 0.00 |
Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redundancy into the data to produce an associated codeword. The redundancy built into the codewords enables one to decode the original data even from a somewhat distorted version of the codeword. The central trade-off in coding theory is the one between the data rate (amount of non-redundant information per bit of codeword) and the error rate (the fraction of symbols that could be corrupted while still enabling data recovery). The traditional decoding algorithms did as badly at correcting any error pattern as they would do for the worst possible error pattern. This severely limited the maximum fraction of errors those algorithms could tolerate. In turn, this was the source of a big hiatus between the error-correction performance known for probabilistic noise models (pioneered by Shannon) and what was thought to be the limit for the more powerful, worst-case noise models (suggested by Hamming). In the last decade or so, there has been much algorithmic progress in coding theory that has bridged this gap (and in fact nearly eliminated it for codes over large alphabets). These developments rely on an error-recovery model called "list decoding," wherein for the pathological error patterns, the decoder is permitted to output a small list of candidates that will include the original message. This book introduces and motivates the problem of list decoding, and discusses the central algorithmic results of the subject, culminating with the recent results on achieving "list decoding capacity."