arXiv (All)
open access
Covering Radius and Deep Holes of Hyperderivative Reed-Solomon Codes under the NRT Metric
The deep hole problem is a fundamental problem in coding theory, and it has many important applications in code constructions and cryptography. The deep hole problem of Reed-Solomon codes has gained a lot of attention. As a generalization of Reed-Solomon codes under Hamming metric, we study the cove
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
- On the structure of polynomial ideal codes and additive Reed--Solomon codes#1356845
- NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes#1077049
- Algorithmic List Decoding at Capacity and Optimal Proximity Gaps for Reed-Solomon Codes#973490
- The Lesser Key of Solomon#1302225
- Code choice among Ngaju Dayaknese students in in-group communication in Petra Christian University#1018487
Record · ID 1341532
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