Optimal Rate List Decoding via Derivative Codes
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 593-604
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Linear-Algebraic List Decoding of Folded Reed-Solomon Codes2011
- Cyclotomic function fields, Artin–Frobenius automorphisms, and list error correction with optimal rateAlgebra & Number Theory, 2010
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal RedundancyIEEE Transactions on Information Theory, 2008
- Algorithmic Results in List DecodingFoundations and Trends® in Theoretical Computer Science, 2007
- Limits to List Decoding Reed–Solomon CodesIEEE Transactions on Information Theory, 2006
- Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time2005
- List decoding with side information2004
- 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
- Highly resilient correctors for polynomialsInformation Processing Letters, 1992