Metraipolis › archive › dc_70b58f672cbb

Rank-metric intersecting codes — arXiv:2611.05059

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05059
License (as archived)
CC0-1.0
Archived
2026-11-04T19:01:43.213Z
SHA-256 of the archived text
bb38f059756e918c531e284fc2b2266381628004023129c82948196daf1ccc2e
Stable URL of this page
https://metraipolis.com/documento/dc_70b58f672cbb

How to cite

Rank-metric intersecting codes — arXiv:2611.05059 — arXiv (en), https://arxiv.org/abs/2611.05059 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_70b58f672cbb (Metraipolis archive dc_70b58f672cbb, sha256 bb38f059756e918c531e284fc2b2266381628004023129c82948196daf1ccc2e)
BibTeX
@misc{dc70b58f672cbb,
  title = {Rank-metric intersecting codes — arXiv:2611.05059},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05059},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_70b58f672cbb; sha256 bb38f059756e918c531e284fc2b2266381628004023129c82948196daf1ccc2e},
  year = {2026}
}

Archived text

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

Intersecting codes are codes in which any two nonzero codewords share a common nonzero coordinate, and they have been extensively studied due to their applications in communication theory, cryptography, and combinatorics. Recently, geometric interpretations have provided new insights into intersecting codes, both in the Hamming metric and, more recently, in the rank metric for linear codes. In this paper, we introduce and study matrix rank-metric intersecting codes. By defining the support of a matrix as its row space, we extend the notion of intersecting codes to the matrix rank-metric setting. Using the slice space associated with the generator tensor of a rank-metric code, we derive a geometric characterization that is equivalent to the intersecting property. This characterization generalizes the known results for linear rank-metric intersecting codes and highlights both analogies and differences with the linear case. In particular, it yields bounds on the parameters of intersecting codes, one of which is sharp and differs from the one in the linear case, together with first constructions. We then consider codes that are closed under multiplication, i.e. matrix algebras. In this setting, the intersecting property can be read off from the algebraic structure, namely the Jacobson radical and the socle. This provides a simple and flexible way to construct many intersecting codes, including codes that do not satisfy the classical sufficient condition on the minimum distance.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.05059 — 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-11-04T18:38:22.343Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).