On the number of inequivalent Gabidulin codes
From MaRDI portal
Publication:1650809
DOI10.1007/S10623-017-0433-6zbMATH Open1398.05032arXiv1702.04582OpenAlexW2765437810MaRDI QIDQ1650809FDOQ1650809
Authors: Kai-Uwe Schmidt, Yue Zhou 
Publication date: 13 July 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Abstract: Maximum rank-distance (MRD) codes are extremal codes in the space of matrices over a finite field, equipped with the rank metric. Up to generalizations, the classical examples of such codes were constructed in the 1970s and are today known as Gabidulin codes. Motivated by several recent approaches to construct MRD codes that are inequivalent to Gabidulin codes, we study the equivalence issue for Gabidulin codes themselves. This shows in particular that the family of Gabidulin codes already contains a huge subset of MRD codes that are pairwise inequivalent, provided that .
Full work available at URL: https://arxiv.org/abs/1702.04582
Recommendations
Exact enumeration problems, generating functions (05A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)
Cites Work
- Bilinear forms over a finite field, with applications to coding theory
- Endliche Gruppen I
- Theory of codes with maximum rank distance
- Non-linear maximum rank distance codes
- Coding for Errors and Erasures in Random Network Coding
- Title not available (Why is that?)
- Handbook of finite translation planes
- Orthogonal dual hyperovals, symplectic spreads, and orthogonal spreads
- Galois extensions and subspaces of alternating bilinear forms with special rank properties
- Dimensional dual hyperovals and APN functions with translation groups
- 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
- Algebraic structures of MRD codes
- Automorphism groups of Gabidulin-like codes
- A unified description of four simply connected dimensional dual hyperovals
- MRD-codes and linear sets
- Maximum scattered linear sets and MRD-codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- On the genericity of maximum rank distance and Gabidulin codes
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- On kernels and nuclei of rank metric codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
Cited In (23)
- Enumeration of inequivalent irreducible Goppa codes
- Rank-metric codes, linear sets, and their duality
- Identifiers for MRD-codes
- Isometries for rank distance and permutation group of gabidulin codes
- Extending two families of maximum rank distance codes
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- On the equivalence issue of a class of 2-dimensional linear maximum rank distance codes
- Non-minimum tensor rank Gabidulin codes
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- Explicit constructions of some non-Gabidulin linear maximum rank distance codes
- On self-dual MRD codes
- Constructions of perfect bases for classes of 3-tensors
- On maximum additive Hermitian rank-metric codes
- On equivalence of maximum additive symmetric rank-distance codes
- Automorphism groups of Gabidulin-like codes
- Generalized twisted Gabidulin codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- MRD codes with maximum idealizers
- Asymptotics of Moore exponent sets
- Matrix graphs and MRD codes over finite principal ideal rings
- Equivalence and characterizations of linear rank-metric codes based on invariants
- On the genericity of maximum rank distance and Gabidulin codes
This page was built for publication: On the number of inequivalent Gabidulin codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650809)
