A fast deterministic algorithm for factoring polynomials over finite fields of small characteristic
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Exponentiation in Finite Fields: Theory and Practice
AAECC-12 Proceedings of the 12th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Reconstructing curves in three (and higher) dimensional space from noisy data
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Expander-Based Constructions of Efficiently Decodable Codes
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
List decoding of error-correcting codes
List decoding of error-correcting codes
Better extractors for better codes?
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Decoding of interleaved Reed Solomon codes over noisy data
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Modern Coding Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Algebraic soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Explicit capacity-achieving list-decodable codes
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Decoding interleaved Reed-Solomon codes over noisy channels
Theoretical Computer Science
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Decodability of group homomorphisms beyond the johnson bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast polynomial factorization and modular composition in small characteristic
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebraic algorithms and coding theory
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
List Error-Correction with Optimal Information Rate (Invited Talk)
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Extractors for Three Uneven-Length Sources
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Technical perspective: The beauty of error-correcting codes
Communications of the ACM - Being Human in the Digital Age
Error correction up to the information-theoretic limit
Communications of the ACM - Being Human in the Digital Age
Improvements on the Johnson bound for Reed-Solomon codes
Discrete Applied Mathematics
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
List decoding tensor products and interleaved codes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Journal of the ACM (JACM)
List Decoding of Binary Codes---A Brief Survey of Some Recent Results
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
IEEE Transactions on Information Theory
Efficient and robust compressed sensing using optimized expander graphs
IEEE Transactions on Information Theory
List decoding and pseudorandom constructions
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Efficient list decoding of explicit codes with optimal redundancy
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Subspace polynomials and limits to list decoding of Reed-Solomon codes
IEEE Transactions on Information Theory
Efficiently decodable non-adaptive group testing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Optimal error correction for computationally bounded noise
IEEE Transactions on Information Theory
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
Root lifting techniques and applications to list decoding
ACM Communications in Computer Algebra
Efficiently decodable error-correcting list disjunct matrices and applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
Kakeya Sets, New Mergers, and Old Extractors
SIAM Journal on Computing
List Decoding Tensor Products and Interleaved Codes
SIAM Journal on Computing
Dynamic threshold and cheater resistance for shamir secret sharing scheme
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
List decoding subspace codes from insertions and deletions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Improved decoding of interleaved AG codes
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Folded codes from function field towers and improved optimal rate list decoding
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
Optimally robust private information retrieval
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Noise-resilient group testing: Limitations and constructions
Discrete Applied Mathematics
A variant of non-adaptive group testing and its application in pay-television via internet
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
Theoretical Computer Science
Hi-index | 0.24 |
We introduce a new family of error-correcting codes that have a polynomial-time encoder and a polynomial-time listdecoder, correcting a fraction of adversarial errors up to \tau {\rm M} = 1 - ^{{\rm M} + 1} \sqrt {{\rm M}^{\rm M} R^{\rm M} } where R is the rate of the code and {\rm M} \ge is an arbitrary integer parameter. This makes it possible to decode beyond the Guruswami-Sudan radius of 1 - \sqrt R for all rates less than 1/16. Stated another way, for any \varepsilon 0, we can listdecode in polynomial time a fraction of errors up to 1 - \varepsilon with a code of length n and rate \Omega(\varepsilon/log(1/\varepsilon)), defined over an alphabet of size n^{\rm M}= n^{{\rm O}(\log (1/\varepsilon ))} . Notably, thiserror-correction is achieved in the worst-case against adversarial errors: a probabilistic model for the error distribution is neither needed nor assumed. The best results so far for polynomial-time list-decoding of adversarial errors required a rate of O(\varepsilon^2) to achieve the correction radius of 1-\varepsilon.Our codes and list-decoders are based on two key ideas. The first is the transition from bivariate polynomial interpolation, pioneered by Sudan and Guruswami-Sudan [12,22], to multivariate interpolation decoding. The second idea is to part ways with Reed-Solomon codes, for which numerous prior attempts [2, 3, 12, 18] at breaking the O(\varepsilon^2) rate barrier in the worst-case were unsuccessful. Rather than devising a better list-decoder for Reed-Solomon codes, we devise better codes. Standard Reed-Solomon encoders view a message as a polynomial f(X) over a field Fq, and produce the corresponding codeword by evaluating f(X) at n distinct elements of Fq. Herein, given f(X), we first compute one or more related polynomials g1(X), g2(X), . . . , gM-1(X) and produce the corresponding codeword by evaluating all these polynomials. Correlation between f (X) and gi(X), carefully designed into our encoder, then provides the additional information we need to recover the encoded message from the output of the multivariate interpolation process.