Adjoint and duality for rank-metric codes in a skew polynomial framework
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911253599879168 |
|---|---|
| author | Gómez-Torrecillas, José Lobillo, F. J. Navarro, Gabriel Santonastaso, Paolo |
| author_facet | Gómez-Torrecillas, José Lobillo, F. J. Navarro, Gabriel Santonastaso, Paolo |
| contents | Skew polynomial rings provide a fundamental example of noncommutative principal ideal domains. Special quotients of these rings yield matrix algebras that play a central role in the theory of rank-metric codes. Recent breakthroughs have shown that specific subsets of these quotients produce the largest known families of maximum rank distance (MRD) codes. In this work, we present a systematic study of transposition and duality operations within quotients of skew polynomial rings. We develop explicit skew-polynomial descriptions of the transpose and dual code constructions, enabling us to determine the adjoint and dual codes associated with the MRD code families recently introduced by Sheekey et al. Building on these results, we compute the nuclear parameters of these codes, and prove that, for a new infinite set of parameters, many of these MRD codes are inequivalent to previously known constructions in the literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_05084 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Adjoint and duality for rank-metric codes in a skew polynomial framework Gómez-Torrecillas, José Lobillo, F. J. Navarro, Gabriel Santonastaso, Paolo Information Theory Combinatorics 16S36, 16S50, 11T71 Skew polynomial rings provide a fundamental example of noncommutative principal ideal domains. Special quotients of these rings yield matrix algebras that play a central role in the theory of rank-metric codes. Recent breakthroughs have shown that specific subsets of these quotients produce the largest known families of maximum rank distance (MRD) codes. In this work, we present a systematic study of transposition and duality operations within quotients of skew polynomial rings. We develop explicit skew-polynomial descriptions of the transpose and dual code constructions, enabling us to determine the adjoint and dual codes associated with the MRD code families recently introduced by Sheekey et al. Building on these results, we compute the nuclear parameters of these codes, and prove that, for a new infinite set of parameters, many of these MRD codes are inequivalent to previously known constructions in the literature. |
| title | Adjoint and duality for rank-metric codes in a skew polynomial framework |
| topic | Information Theory Combinatorics 16S36, 16S50, 11T71 |
| url | https://arxiv.org/abs/2511.05084 |