conference-paper
Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
Research footprint
At a glance
- Citations
- 0
- References
- 0
- Comments
- 0
Paper overview
Abstract
Folded Reed-Solomon (FRS) codes are a well-studied family of codes, known for achieving list decoding capacity. In this work, we give improved deterministic and randomized algorithms for list decoding FRS codes of rate \(R\) up to radius \(1 - R - \varepsilon\).
Record transparency
Publication details
- DOI
- 10.1137/1.9781611978971.35
- OpenAlex
- W7119023477
- Document type
- conference-paper
- Language
- EN
- Source
- Society for Industrial and Applied Mathematics eBooks
- Last metadata update
Comments
Log in to join the discussion.