Efficient List Decoding of Explicit Codes with Optimal Redundancy
From MaRDI portal
Publication:5386076
DOI10.1007/978-3-540-77224-8_6zbMath1195.94093OpenAlexW1740277216MaRDI QIDQ5386076
Publication date: 17 April 2008
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77224-8_6
Cites Work
- Unnamed Item
- Unnamed Item
- Decoding of Reed Solomon codes beyond the error-correction bound
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Explicit capacity-achieving list-decodable codes
- Error-correcting codes for list decoding
- Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
- Better Binary List-Decodable Codes Via Multilevel Concatenation
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List Decoding and Pseudorandom Constructions
- Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
This page was built for publication: Efficient List Decoding of Explicit Codes with Optimal Redundancy
