
TL;DR
This paper characterizes the equivalence of a new class of maximum rank-metric codes introduced by Sheekey, explores their algebraic structures, and determines their automorphism groups, including those of twisted Gabidulin codes.
Contribution
It generalizes the known results on the equivalence and automorphisms of twisted Gabidulin codes to Sheekey's new class of MRD codes.
Findings
Characterization of code equivalence for Sheekey's codes
Identification of the right nucleus, middle nucleus, and duals of these codes
Calculation of the automorphism group and its size for these codes
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · Finite Group Theory Research
