Skew polynomial representations of matrix algebras and applications to coding theory
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915663601205248 |
|---|---|
| author | Neri, Alessandro Santonastaso, Paolo |
| author_facet | Neri, Alessandro Santonastaso, Paolo |
| contents | We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight function on their associated skew polynomials, defined through degrees and greatest common right divisors with the polynomial that defines the representation. We exploit this representation to construct new families of maximum sum-rank distance (MSRD) codes over finite and infinite fields, and over division rings. These constructions generalize many of the known existing constructions of MSRD codes as well as of optimal codes in the rank and in the Hamming metric. As a byproduct, in the case of finite fields we obtain new families of MDS codes which are linear over a subfield and whose length is close to the field size. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_08602 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Skew polynomial representations of matrix algebras and applications to coding theory Neri, Alessandro Santonastaso, Paolo Information Theory Rings and Algebras 16S36, 16S50, 11T71, 94B05 We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight function on their associated skew polynomials, defined through degrees and greatest common right divisors with the polynomial that defines the representation. We exploit this representation to construct new families of maximum sum-rank distance (MSRD) codes over finite and infinite fields, and over division rings. These constructions generalize many of the known existing constructions of MSRD codes as well as of optimal codes in the rank and in the Hamming metric. As a byproduct, in the case of finite fields we obtain new families of MDS codes which are linear over a subfield and whose length is close to the field size. |
| title | Skew polynomial representations of matrix algebras and applications to coding theory |
| topic | Information Theory Rings and Algebras 16S36, 16S50, 11T71, 94B05 |
| url | https://arxiv.org/abs/2512.08602 |