Puncturing maximum rank distance codes
Combinatorics
2018-07-12 v1
Abstract
We investigate punctured maximum rank distance codes in cyclic models for bilinear forms of finite vector spaces. In each of these models we consider an infinite family of linear maximum rank distance codes obtained by puncturing generalized twisted Gabidulin codes. We calculate the automorphism group of such codes and we prove that this family contains many codes which are not equivalent to any generalized Gabidulin code. This solves a problem posed recently by Sheekey in [30].
Cite
@article{arxiv.1807.04108,
title = {Puncturing maximum rank distance codes},
author = {Bence Csajbók and Alessandro Siciliano},
journal= {arXiv preprint arXiv:1807.04108},
year = {2018}
}
Comments
Manuscript. Final version to appear in Journal of Algebraic Combinatorics