Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
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\).
Fields of Study & Subjects
Coding theory and cryptography
graph theory and CDMA systems
Cryptographic Implementations and Security
Publication details
- Journal / source
- Society for Industrial and Applied Mathematics eBooks
- Pages
- 880–898
- Publication date
- 1 January 2026
- Language
- EN