REAL

Puncturing maximum rank distance codes

Csajbók, Bence and Siciliano, Alessandro (2018) Puncturing maximum rank distance codes. Journal of Algebraic Combinatorics. ISSN 0925-9899, ESSN: 1572-9192 (In Press)

[img] Text
Csajbok_Siciliano_final.pdf
Restricted to Registered users only until 15 August 2019.

Download (383kB) | Request a copy

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 (Adv Math Commun 10:475–488, 2016).

Item Type: Article
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA72 Algebra / algebra
Q Science / természettudomány > QA Mathematics / matematika > QA73 Geometry / geometria
Depositing User: Bence Csajbók
Date Deposited: 13 Sep 2018 06:25
Last Modified: 13 Sep 2018 06:25
URI: http://real.mtak.hu/id/eprint/83795

Actions (login required)

Edit Item Edit Item