arXiv (All)
open access
Reed-Solomon Codes at Capacity: Algorithmic List-Decoding and Proximity Gaps
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 characteris
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distinguishers for Skew and Linearized Reed-Solomon Codes#13008
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- codes_analyses#253902
- Two variants of Twisted Reed-Solomon Codes#1110566
- Edge codes constructed from unicyclic graphs#799611
Record · ID 1218402
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive