Explicit constructions of some non-Gabidulin linear maximum rank distance codes

DOI10.3934/amc.2016028zbMath1348.94101OpenAlexW2510431879MaRDI QIDQ326343

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

zbMATH Keywords

rank metric codesgeneralized Gabidulin codesmaximum rank distance (MRD) codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (8)

Self-duality of generalized twisted Gabidulin codes ⋮ Further results on LCD generalized Gabidulin codes ⋮ Nuclei and automorphism groups of generalized twisted Gabidulin codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Some new non-additive maximum rank distance codes ⋮ An asymptotically optimal construction of almost affinely disjoint subspaces ⋮ Rank-Metric Codes and Their Applications

Cites Work

• A new family of linear maximum rank distance codes
• Algebraic structures of MRD codes
• Linearized polynomial maps over finite fields
• Theory of codes with maximum rank distance
• Bilinear forms over a finite field, with applications to coding theory
• 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
• On Cryptosystems Based on Polynomials and Finite Fields
• On a Special Class of Polynomials

This page was built for publication: Explicit constructions of some non-Gabidulin linear maximum rank distance codes