Puncturing maximum rank distance codes

被引：5
|
作者：
Csajbok, Bence [1 ]
Siciliano, Alessandro [2 ]
机构：
[1] Eotvos Lorand Univ, Dept Geometry, MTA ELTE Geometr & Algebra Combinator Res Grp, Pazmany P Stny 1-C, H-1117 Budapest, Hungary
[2] Univ Basilicata, Dipartimento Matemat Informat & Econ, Potenza, Italy
来源：
JOURNAL OF ALGEBRAIC COMBINATORICS | 2019年 / 49卷 / 04期
关键词：
Maximum rank distance code; Circulant matrix; Singer cycle;
D O I：
10.1007/s10801-018-0833-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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 (Adv Math Commun 10:475-488, 2016).
引用
收藏
页码：507 / 534
页数：28
相关论文
共 50 条
12345