Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants

Abstract

We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. The same property is proven for the sequence of dimensions of the intersections of itself under several applications of a field automorphism. These invariants give rise to easily computable criteria to check if two codes are inequivalent. We derive some concrete values and bounds for these dimension sequences for some known families of rank-metric codes, namely Gabidulin and (generalized) twisted Gabidulin codes. We then derive conditions on the length of the codes with respect to the field extension degree, such that codes from different families cannot be equivalent. Furthermore, we derive upper and lower bounds on the number of equivalence classes of Gabidulin codes and twisted Gabidulin codes, improving a result of Schmidt and Zhou for a wider range of parameters. In the end we use the aforementioned sequences to determine a characterization result for Gabidulin codes.

arXiv comment37 pages, 1 figure, 3 tables, extended version of arXiv:1905.11326

References in corpus (15)

• A Rank-Metric Approach to Error Control in Random Network Coding
• Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
• Universal Secure Network Coding via Rank-Metric Codes
• Generalized Twisted Gabidulin Codes
• New Criteria for MRD and Gabidulin Codes and some Rank-Metric Code Constructions
• On the Genericity of Maximum Rank Distance and Gabidulin Codes
• Rank metric and Gabidulin codes in characteristic zero
• New Semifields and new MRD Codes from Skew Polynomial Rings
• MRD codes with maximum idealizers
• Further Generalisations of Twisted Gabidulin Codes
• Identifiers for MRD-codes
• On the number of inequivalent Gabidulin codes
• On the security of a Loidreau's rank metric code based encryption scheme
• A new family of maximum scattered linear sets in $\mathrm{PG}(1,q^6)$
• MRD-codes arising from the trinomial $x^q+x^{q^3}+c{x}^{q^5}\in {\mathbb{F}}_{q^6}[x]$

Cited by in corpus (4)

• Vertex properties of maximum scattered linear sets of $\mathrm{PG}(1,q^n)$
• On the hardness of code equivalence problems in rank metric
• On certain linearized polynomials with high degree and kernel of small dimension
• A geometric invariant of linear rank-metric codes