Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps

2026-10-07来源 arXiv math.ITEnglish
arXiv:2610.08610v1 Announce Type: cross Abstract: Understanding the limits of list-decodability of Reed-Solomon codes has been one of the most important open problems in algebraic coding theory. Recently, Brakensiek, Chen, Putterman, Zhang, and Zheng, in a remarkable breakthrough, showed that Reed-Solomon (RS) codes over fields of large characteristic are algorithmically list-decodable all the way up to capacity. Building on this result, Jeronimo subsequently extended these techniques to solve the proximity-gaps question for RS codes. In this article, we give a unified and transparent exposition of these results.

原文：https://www.a8q9.cn/en/article/reed-solomon-codes-at-capacity-algorithmic-list-decoding-and-proximity-gaps-c7c281.html

相关文章