A new family of linear maximum rank distance codes
Combinatorics
2016-06-08 v2
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.
Keywords
Cite
@article{arxiv.1504.01581,
title = {A new family of linear maximum rank distance codes},
author = {John Sheekey},
journal= {arXiv preprint arXiv:1504.01581},
year = {2016}
}