arXiv (All)
open access
On the structure of polynomial ideal codes and additive Reed--Solomon codes
We study structural properties of polynomial ideal (PI) codes and additive Reed--Solomon (aRS) codes in the folded Hamming metric (equivalently, the Hamming metric over a larger alphabet). We first determine the maximum possible length of PI codes, prove that the dual of every PI code is a generaliz
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
- Covering Radius and Deep Holes of Hyperderivative Reed-Solomon Codes under the NRT Metric#1341532
- The crossing number and the unit-distance crossing number of the Hamming graphs H(d,3)=K_3^{box d}, and their realizations over many coordinate fields#1083260
- Generalized Reed-Muller codes and curves with many points#639171
- Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed-Solomon Codes#973490
Record · ID 1356845
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