Guardado en:
Detalles Bibliográficos
Autor principal: Martínez-Peñas, Umberto
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:https://arxiv.org/abs/2402.03084
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866909093730451456
author Martínez-Peñas, Umberto
author_facet Martínez-Peñas, Umberto
contents In this work, we provide four methods for constructing new maximum sum-rank distance (MSRD) codes. The first method, a variant of cartesian products, allows faster decoding than known MSRD codes of the same parameters. The other three methods allow us to extend or modify existing MSRD codes in order to obtain new explicit MSRD codes for sets of matrix sizes (numbers of rows and columns in different blocks) that were not attainable by previous constructions. In this way, we show that MSRD codes exist (by giving explicit constructions) for new ranges of parameters, in particular with different numbers of rows and columns at different positions.
format Preprint
id arxiv_https___arxiv_org_abs_2402_03084
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle New constructions of MSRD codes
Martínez-Peñas, Umberto
Information Theory
In this work, we provide four methods for constructing new maximum sum-rank distance (MSRD) codes. The first method, a variant of cartesian products, allows faster decoding than known MSRD codes of the same parameters. The other three methods allow us to extend or modify existing MSRD codes in order to obtain new explicit MSRD codes for sets of matrix sizes (numbers of rows and columns in different blocks) that were not attainable by previous constructions. In this way, we show that MSRD codes exist (by giving explicit constructions) for new ranges of parameters, in particular with different numbers of rows and columns at different positions.
title New constructions of MSRD codes
topic Information Theory
url https://arxiv.org/abs/2402.03084