arXiv (All)
open access
Deep holes of full-length Reed--Solomon codes: uniform bounds and exact classifications
Let $u$ be a received word for the full-length Reed--Solomon code $\operatorname{RS}_q(k)$, with interpolation polynomial $f_u$ of degree $k+m$. For each $m\in\{3,4,5,6,7\}$, we classify all such deep holes over every finite field, without a field-size hypothesis. None occur for odd $m$ in this rang
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
- Extension of MDS Codes over Finite Fields#1424141
- Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach#1389166
- Algorithmic List Decoding of Reed-Solomon Codes up to Capacity#985406
- Edge codes constructed from unicyclic graphs#799611
- Generating cyclic pivot Gray codes for well-ordered $k$-degenerate graphs in constant amortized time#1233449
Record · ID 1424578
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