Explicit constructions of some non-Gabidulin linear maximum rank distance codes
From MaRDI portal
Recommendations
Cites work
- A new family of linear maximum rank distance codes
- Algebraic structures of MRD codes
- Bilinear forms over a finite field, with applications to coding theory
- Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes
- Linearized polynomial maps over finite fields
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- On Cryptosystems Based on Polynomials and Finite Fields
- On a Special Class of Polynomials
- Theory of codes with maximum rank distance
Cited in
(22)- On the genericity of maximum rank distance and Gabidulin codes
- Further results on LCD generalized Gabidulin codes
- Extending two families of maximum rank distance codes
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Constructing MRD codes by switching
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- An asymptotically optimal construction of almost affinely disjoint subspaces
- Constructions of rank metric codes under actions of the unitary groups
- Non-minimum tensor rank Gabidulin codes
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
- Equivalence and characterizations of linear rank-metric codes based on invariants
- MRD codes: constructions and connections
- scientific article; zbMATH DE number 2154122 (Why is no real title available?)
- Rank-metric codes and their applications
- New MRD codes from linear cutting blocking sets
- On the number of inequivalent Gabidulin codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- Self-duality of generalized twisted Gabidulin codes
- A new family of linear maximum rank distance codes
- Some new non-additive maximum rank distance codes
- Puncturing maximum rank distance codes
- Non-linear MRD codes from cones over exterior sets
This page was built for publication: Explicit constructions of some non-Gabidulin linear maximum rank distance codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326343)