arXiv (All)
open access
NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes
For an $[n,K]$ Reed--Solomon code, the covering radius is $n-K$. Gandikota, Ghazi, and Grigorescu proved deterministic NP-hardness of bounded-distance decoding when the decoding radius is $d$ below the covering radius for every $1\le d\le c\log n/\log\log n$, where $c>0$ is an absolute constant. We
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
- Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed-Solomon Codes#973490
- Algorithmic List Decoding of Reed-Solomon Codes up to Capacity#985406
- Dual lattice attacks for bounded distance decoding, revisited#1141805
- Spectral synthesis with the complexity parameter in $\mathbb{Z}_N^d$#1051897
- Fan-goodness of sparse graphs#1014529
Record · ID 1077049
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