A new family of linear maximum rank distance codes

From MaRDI portal
Publication:326326

DOI10.3934/AMC.2016019zbMATH Open1348.94087arXiv1504.01581OpenAlexW2963120842MaRDI QIDQ326326FDOQ326326

John Sheekey

Publication date: 12 October 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: In this article we construct a new family of linear maximum rank distance (MRD) codes for all parameters. This family contains the only known family for general parameters, the Gabidulin codes, and contains codes inequivalent to the Gabidulin codes. This family also contains the well-known family of semifields known as Generalised Twisted Fields. We also calculate the automorphism group of these codes, including the automorphism group of the Gabidulin codes.


Full work available at URL: https://arxiv.org/abs/1504.01581




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





This page was built for publication: A new family of linear maximum rank distance codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326326)