Improved List Size for Folded Reed-Solomon Codes
Shashank Srivastava · Society for Industrial and Applied Mathematics eBooks · 2025
Folded Reed-Solomon (FRS) codes are variants of Reed-Solomon codes, known for their optimal list decoding radius. We show explicit FRS codes with rate R that can be list decoded up to radius 1 — R — ε with lists of size O (1/ε2). This improves the best known list size among explicit list decoding capacity achieving codes.