arXiv (All)
open access
Covering radius of rank-metric codes via covering lifts and clubs
We introduce a generator-matrix-based geometric approach to the covering radius of $\mathbb F_{q^m}$-linear rank-metric codes. Starting from the $q$-system associated with the code, we define the notion of covering lift and show that the covering radius can be recovered from the hyperplane weights o
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 Hamming distance properties of group codes#490073
- Random Algebraic Geometry Codes Approach the Half-Singleton Bound for Insertions and Deletions#974018
- Projector additive group codes#821838
- Decoding rank metric Reed-Muller codes#153696
- Infinite families of 3-designs from linear and nonlinear codes#1109523
Record · ID 1249206
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