Metraipolis › archive › dc_e2c181fe455a
Covering radius of rank-metric codes via covering lifts and clubs — arXiv:2610.11926
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.11926
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:29:08.889Z
- SHA-256 of the archived text
72b853f5d604ab831971eabf58cd57e2131744b93319254aa9d654f2d173e1b5- Stable URL of this page
https://metraipolis.com/documento/dc_e2c181fe455a
How to cite
Covering radius of rank-metric codes via covering lifts and clubs — arXiv:2610.11926 — arXiv (en), https://arxiv.org/abs/2610.11926 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2c181fe455a (Metraipolis archive dc_e2c181fe455a, sha256 72b853f5d604ab831971eabf58cd57e2131744b93319254aa9d654f2d173e1b5)
BibTeX
@misc{dce2c181fe455a,
title = {Covering radius of rank-metric codes via covering lifts and clubs — arXiv:2610.11926},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.11926},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2c181fe455a; sha256 72b853f5d604ab831971eabf58cd57e2131744b93319254aa9d654f2d173e1b5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.11926. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 of such lifts. This yields an exact criterion, in terms of the length and effective length of the code, for the covering radius to attain its largest possible value, together with the upper bound $\rho(\mathcal{C})\le \min\{m,n\}-1$ in all remaining cases. We then specialize our approach to $1$-dimensional codes, for which the effective length coincides with the minimum rank distance. In this setting, codes attaining $\rho(\mathcal{C})= \min\{m,n\}-1$ are related to covering lifts that are clubs. More generally, we characterize this case through linear maps into suitable quotient spaces, obtaining equivalent interpretations in terms of generalised evasive subspaces and auxiliary matrix rank-metric codes. These results determine the covering radius for several boundary values of the minimum distance and for all $1$-dimensional codes with extension degree $m\in\{3,4,5\}$. For $m=6$ and every $q$ we provide constructions and, for $q\in\{2,3\}$, computational results showing that $1$-dimensional rank-metric codes with the same length and minimum distance can have different covering radii.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.11926 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:53:57.287Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).