List decoding: algorithms and applications
ACM SIGACT News
Randomness conductors and constant-degree lossless expanders
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
Linear time encodable and list decodable codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Linear time erasure codes with nearly optimal recovery
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Error Exponents of Expander Codes under Linear-Complexity Decoding
SIAM Journal on Discrete Mathematics
Better extractors for better codes?
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
IEEE Transactions on Information Theory - Part 1
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 encoding of low-density parity-check codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Error exponents of expander codes
IEEE Transactions on Information Theory
Linear-time encodable/decodable codes with near-optimal rate
IEEE Transactions on Information Theory
Algorithmic results in list decoding
Foundations and Trends® in Theoretical Computer Science
Algorithms and theory of computation handbook
| Hi-index | 0.00 |
The central algorithmic problem in coding theory is the construction of explicit error-correcting codes with good parameters together with fast algorithms for encoding a message and decoding a noisy received word into the correct message. Over the last decade, significant new developments have taken place on this problem using graph-based/combinatorial constructions that exploit the power of expander graphs. The role of expander graphs in theoretical computer science is by now certainly well-appreciated. Here, we will survey some of the highlights of the use of expanders in constructions of error-correcting codes.