On the number of inequivalent Gabidulin codes
From MaRDI portal
(Redirected from Publication:1650809)
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 .
Recommendations
Cites work
- scientific article; zbMATH DE number 926611 (Why is no real title available?)
- A generalization of the normal rational curve in \(\mathrm {PG}(d,q^n)\) and its associated non-linear MRD codes
- A new family of linear maximum rank distance codes
- A unified description of four simply connected dimensional dual hyperovals
- Algebraic structures of MRD codes
- Automorphism groups of Gabidulin-like codes
- Bilinear forms over a finite field, with applications to coding theory
- Coding for Errors and Erasures in Random Network Coding
- Dimensional dual hyperovals and APN functions with translation groups
- Endliche Gruppen I
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Galois extensions and subspaces of alternating bilinear forms with special rank properties
- Handbook of finite translation planes
- MRD-codes and linear sets
- Maximum scattered linear sets and MRD-codes
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Non-linear maximum rank distance codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- On kernels and nuclei of rank metric codes
- On the genericity of maximum rank distance and Gabidulin codes
- Orthogonal dual hyperovals, symplectic spreads, and orthogonal spreads
- Theory of codes with maximum rank distance
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
- 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
- Non-minimum tensor rank Gabidulin codes
- On maximum additive Hermitian rank-metric codes
- Constructions of perfect bases for classes of 3-tensors
- 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)
