List Decoding of Binary Codes–A Brief Survey of Some Recent Results
From MaRDI portal
Publication:5323002
DOI10.1007/978-3-642-01877-0_10zbMath1248.94123OpenAlexW2097499124MaRDI QIDQ5323002
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01877-0_10
Related Items (2)
Cites Work
- Unnamed Item
- 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
- List decoding algorithms for certain concatenated codes
- Error-correcting codes for list decoding
- Algebraic soft-decision decoding of reed-solomon codes
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Combinatorial bounds for list decoding
- Better Binary List Decodable Codes Via Multilevel Concatenation
- Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
- Weight Distribution and List-Decoding Size of Reed–Muller Codes
- Soft Decoding, Dual BCH Codes, and Better List-Decodable $\varepsilon$-Biased Codes
This page was built for publication: List Decoding of Binary Codes–A Brief Survey of Some Recent Results
