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 条
  • [11] Non-linear maximum rank distance codes
    Antonio Cossidente
    Giuseppe Marino
    Francesco Pavese
    Designs, Codes and Cryptography, 2016, 79 : 597 - 609
  • [12] Non-linear maximum rank distance codes
    Cossidente, Antonio
    Marino, Giuseppe
    Pavese, Francesco
    DESIGNS CODES AND CRYPTOGRAPHY, 2016, 79 (03) : 597 - 609
  • [13] On the decoder error probability of bounded rank-distance decoders for maximum rank distance codes
    Gadouleau, Maximilien
    Yan, Zhiyuan
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (07) : 3202 - 3206
  • [14] A New Approach for Constructing and Decoding Maximum Rank Distance Codes
    Mandavifar, Hessam
    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017,
  • [15] Digital signature scheme based on maximum rank distance codes
    Du, Wei-Zhang
    Chen, Ke-Fei
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2002, 39 (09): : 1043 - 1045
  • [16] McEliece publickey cryptosystem based on maximum rank distance codes
    Du, Weizhang
    Wang, Xinmei
    Jisuanji Gongcheng/Computer Engineering, 2000, 26 (08): : 33 - 34
  • [17] On equivalence of maximum additive symmetric rank-distance codes
    Zhou, Yue
    DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (05) : 841 - 850
  • [18] On equivalence of maximum additive symmetric rank-distance codes
    Yue Zhou
    Designs, Codes and Cryptography, 2020, 88 : 841 - 850
  • [19] New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes
    Xu, Liqing
    Chen, Hao
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (09) : 6315 - 6319
  • [20] On interpolation-based decoding of a class of maximum rank distance codes
    Kadir, Wrya K.
    Li, Chunlei
    Zullo, Ferdinando
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 31 - 36
12345