Explicit capacity-achieving list-decodable codes
Authors:
Open Access
- 21 May 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time2005
- Linear-Time Encodable/Decodable Codes With Near-Optimal RateIEEE Transactions on Information Theory, 2005
- Simple extractors for all min-entropies and a new pseudorandom generatorJournal of the ACM, 2005
- Reed-solomon codes for correcting phased error burstsIEEE Transactions on Information Theory, 2003
- Combinatorial bounds for list decodingIEEE Transactions on Information Theory, 2002
- Limits to list decodability of linear codes2002
- List decodingACM SIGACT News, 2000
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Decoding of Reed Solomon Codes beyond the Error-Correction BoundJournal of Complexity, 1997
- Error-correcting codes for list decodingIEEE Transactions on Information Theory, 1991