Equivalence and characterizations of linear rank-metric codes based on invariants
From MaRDI portal
Publication:2197149
DOI10.1016/J.LAA.2020.06.014zbMATH Open1447.51010arXiv1911.13059OpenAlexW3037157003MaRDI QIDQ2197149FDOQ2197149
Authors: Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann 
Publication date: 28 August 2020
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1911.13059
Recommendations
- Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
- A new family of linear maximum rank distance codes
- On the number of inequivalent Gabidulin codes
- Isometries for rank distance and permutation group of gabidulin codes
- Identifiers for MRD-codes
Combinatorial aspects of finite geometries (05B25) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)
Cites Work
- Bilinear forms over a finite field, with applications to coding theory
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
- Structural attacks for public key cryptosystems based on Gabidulin codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of codes with maximum rank distance
- Linearized polynomials over finite fields revisited
- A Rank-Metric Approach to Error Control in Random Network Coding
- Title not available (Why is that?)
- Maximum-rank array codes and their application to crisscross error correction
- Universal Secure Network Coding via Rank-Metric Codes
- Title not available (Why is that?)
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- A new family of linear maximum rank distance codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- Isometries for rank distance and permutation group of gabidulin codes
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
- Generalized twisted Gabidulin codes
- Maximum rank distance codes as space~time codes
- Vandermonde and Wronskian matrices over division rings
- On the classification of hyperovals
- A new family of MRD-codes
- New maximum scattered linear sets of the projective line
- Additive Rank Metric Codes
- On the number of inequivalent Gabidulin codes
- On the genericity of maximum rank distance and Gabidulin codes
- MRD-codes arising from the trinomial \(x^q + x^{q^3} + c x^{q^5} \in \mathbb{F}_{q^6} [x]\)
- Identifiers for MRD-codes
- New semifields and new MRD codes from skew polynomial rings
- MRD codes with maximum idealizers
- A new rank metric codes based encryption scheme
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- 13. MRD codes: constructions and connections
- Random construction of partial MDS codes
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes
- Generalized Gabidulin codes over fields of any characteristic
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
- A rank criterion for QAM space-time codes
- Tensor codes for the rank metric
- Efficient Encryption From Random Quasi-Cyclic Codes
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
Cited In (11)
- Equivalence, group of automorphism and invariants of a family of rank metric codes arising from linearized polynomials
- Linearized trinomials with maximum kernel
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Isometries for rank distance and permutation group of gabidulin codes
- Extending two families of maximum rank distance codes
- Title not available (Why is that?)
- Equidistant rank metric codes: construction and properties
- Vertex properties of maximum scattered linear sets of \(\mathrm{PG} ( 1 , q^n )\)
- Rank-Metric Codes and Their Applications
- Scattered subspaces and related codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
Uses Software
This page was built for publication: Equivalence and characterizations of linear rank-metric codes based on invariants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197149)
