Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries (Q2363094): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1704.02110 / rank | |||
Normal rank | |||
Revision as of 05:04, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries |
scientific article |
Statements
Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries (English)
0 references
13 July 2017
0 references
Summary: In this paper we construct infinite families of non-linear maximum rank distance codes by using the setting of bilinear forms of a finite vector space. We also give a geometric description of such codes by using the cyclic model for the field reduction of finite geometries and we show that these families contain the non-linear maximum rank distance codes recently provided by Cossidente, Marino and Pavese.
0 references
maximum rank distance code
0 references
bilinear form
0 references
circulant matrix
0 references
