New MRD codes from linear cutting blocking sets

DOI10.1007/S10231-022-01235-5MaRDI QIDQ6409860arXivFDO

Authors Daniele Bartoli, Giuseppe Marino, Alessandro Neri

Publication date 6 September 2022

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10231-022-01235-5

Mathematics Subject Classification ID

Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05)

arXiv classification

cs.ITmath.COmath.IT

Abstract: Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we provide the first construction of a family of $mathbb{F}_{q^m}$-linear MRD codes of length $2m$ that are not obtained as a direct sum of two smaller MRD codes. In addition, such a family has better parameters, since its codes possess generalized rank weights strictly larger than those of the previously known MRD codes. This shows that not all the MRD codes have the same generalized rank weights, in contrast to what happens in the Hamming metric setting.

This page was built for publication: New MRD codes from linear cutting blocking sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409860)