Explicit constructions of some non-Gabidulin linear maximum rank distance codes
From MaRDI portal
Publication:326343
DOI10.3934/AMC.2016028zbMATH Open1348.94101OpenAlexW2510431879MaRDI QIDQ326343FDOQ326343
Authors: Kamil Otal, Ferruh Özbudak 
Publication date: 12 October 2016
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2016028
Recommendations
Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- Bilinear forms over a finite field, with applications to coding theory
- Theory of codes with maximum rank distance
- 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
- On Cryptosystems Based on Polynomials and Finite Fields
- Linearized polynomial maps over finite fields
- On a Special Class of Polynomials
Cited In (22)
- Constructions of optimal rank-metric codes from automorphisms of rational function fields
- Extending two families of maximum rank distance codes
- MRD codes: constructions and connections
- Self-duality of generalized twisted Gabidulin codes
- Constructions of rank metric codes under actions of the unitary groups
- Further results on LCD generalized Gabidulin codes
- Title not available (Why is that?)
- Puncturing maximum rank distance codes
- Non-minimum tensor rank Gabidulin codes
- A new family of linear maximum rank distance codes
- Some new non-additive maximum rank distance codes
- Nuclei and automorphism groups of generalized twisted Gabidulin codes
- Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries
- Non-linear MRD codes from cones over exterior sets
- Rank-metric codes and their applications
- New MRD codes from linear cutting blocking sets
- Constructing MRD codes by switching
- Equivalence and characterizations of linear rank-metric codes based on invariants
- On the number of inequivalent Gabidulin codes
- On the genericity of maximum rank distance and Gabidulin codes
- An asymptotically optimal construction of almost affinely disjoint subspaces
- New criteria for MRD and Gabidulin codes and some rank-metric code constructions
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)
