arXiv (All)
open access
Algorithmic List Decoding of Reed-Solomon Codes up to Capacity
We give a deterministic polynomial-time list-decoding algorithm for Reed-Solomon codes over prime fields that approaches list-decoding capacity for every evaluation set and every constant rate.
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
- NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes#1077049
- Unsound Search with Policy and Value Networks in Legends of Code and Magic#974903
- Cryptography based on error correcting codes#460193
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#781144
- Improved Subexponential Upper Bounds for $3$-Restricted Matching Vector Families#779769
Record · ID 985406
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