Metraipolis › archive › dc_259e8d351ef6

Code distances of matrix rank-metric codes under Add-and-Remove transformations — arXiv:2610.03460

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.03460
License (as archived)
CC0-1.0
Archived
2026-10-06T08:40:29.977Z
SHA-256 of the archived text
6ba5448707e7d308c3a8ad6db9bdbd01b0d92f0aca393c1ab7c48922ca4a2679
Stable URL of this page
https://metraipolis.com/documento/dc_259e8d351ef6

How to cite

Code distances of matrix rank-metric codes under Add-and-Remove transformations — arXiv:2610.03460 — arXiv (en), https://arxiv.org/abs/2610.03460 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_259e8d351ef6 (Metraipolis archive dc_259e8d351ef6, sha256 6ba5448707e7d308c3a8ad6db9bdbd01b0d92f0aca393c1ab7c48922ca4a2679)
BibTeX
@misc{dc259e8d351ef6,
  title = {Code distances of matrix rank-metric codes under Add-and-Remove transformations — arXiv:2610.03460},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.03460},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_259e8d351ef6; sha256 6ba5448707e7d308c3a8ad6db9bdbd01b0d92f0aca393c1ab7c48922ca4a2679},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03460. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a matrix rank-metric code $\mathcal{C}$ and an integer $i$, the $i$-th subcode distance of $\mathcal{C}$ is the largest minimum rank distance of an $i$-dimensional subcode of $\mathcal{C}$. We study how subcode distances change under the Add-and-Remove construction, in which a subcode of codimension $\ell_s$ is kept and a space of dimension $\ell_a$ is added; this construction is used, with Gabidulin codes, in the $\mathsf{MIRANDA}$ signature scheme. For arbitrary matrix codes, we give inequalities between the subcode distances of the original and of the new code, and we show that Delsarte duality interchanges $\ell_s$ and $\ell_a$. For matrix Gabidulin codes, whose subcode distances are given by an explicit formula, we show that, if $\ell_s<\max\{m,n\}$, then within each block of indices $(a-1)\max\{m,n\}+1,\ldots,a\max\{m,n\}$ not exceeding $\dim_{\mathbb{F}_q}(\mathcal{C}_s)$, all but the last $\ell_s$ subcode distances are the same as for the Gabidulin code, and the remaining ones decrease by at most one; a small example shows that such a decrease can occur. We also express the minimum distance of the new code in terms of the rank distance between the added space and the common subcode. For $\mathsf{MIRANDA}$, the lower bound on the minimum distance of the dual public code used by the known distinguisher when $\ell_s=0$ is a special case of these results; for the proposed parameters, where $\ell_s>0$, the same bound holds for a subcode of codimension $\ell_s$ of the dual public code.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.03460 — 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-06T08:19:47.059Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).