A note on rank-metric codes
From MaRDI portal
Publication:6344403
arXiv2007.01991MaRDI QIDQ6344403FDOQ6344403
Authors: José Alves Oliveira
Publication date: 3 July 2020
Abstract: Let denote the finite field with elements. Maximum Rank-metric codes (MRD for short) are subsets of whose number of elements attains the Singleton-like bound. The first MRD codes known was found by Delsarte (1978) and Gabidulin (1985). Sheekey (2016) presented a new class of MRD codes over called twisted Gabidulin codes and also proposed a generalization of the twisted Gabidulin codes to the codes . The equivalence and duality of twisted Gabidulin codes was discussed by Lunardoni, Trombetti, and Zhou (2018). A new class of MRD codes in was found by Trombetti-Zhou (2018). In this work, we characterize the equivalence of the class of codes proposed by Sheekey, generalizing the results known for twisted Gabidulin codes and Trombetti-Zhou codes. In the second part of the paper, we restrict ourselves to the case , where we present its right nucleus, middle nucleus, Delsarte dual and adjoint codes. In the last section, we present the automorphism group of and compute its cardinality. In particular, we obtain the number of elements in the automorphism group of the twisted Gabidulin codes.
This page was built for publication: A note on rank-metric codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344403)