On the Sparseness of Certain MRD Codes

06/27/2019
by   Heide Gluesing-Luerssen, et al.
0

We determine the proportion of [3× 3;3]-MRD codes over F_q within the space of all 3-dimensional rank-metric codes over the same field. This shows that these MRD codes are sparse in the sense that this proportion tends to 0 as q→∞. The computation is accomplished by reducing the space of all such rank-metric codes to a space of specific bases and subsequently making use of a result by Menichetti (1973) on 3-dimensional semifields.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2022

On the Density of Codes over Finite Chain Rings

We determine the asymptotic proportion of free modules over finite chain...
research
08/30/2021

On a family of linear MRD codes with parameters [8×8,16,7]_q

In this paper we consider a family ℱ of 16-dimensional 𝔽_q-linear rank m...
research
11/30/2017

On deep-holes of Gabidulin codes

In this paper, we determine the covering radius and a class of deep hole...
research
01/20/2022

Non-minimum tensor rank Gabidulin codes

The tensor rank of some Gabidulin codes of small dimension is investigat...
research
06/02/2023

Short rank-metric codes and scattered subspaces

By exploiting the connection between scattered 𝔽_q-subspaces of 𝔽_q^m^3 ...
research
04/26/2023

MacWilliams' Extension Theorem for rank-metric codes

The MacWilliams' Extension Theorem is a classical result by Florence Jes...
research
05/04/2023

Majorizing Measures, Codes, and Information

The majorizing measure theorem of Fernique and Talagrand is a fundamenta...

Please sign up or login with your details

Forgot password? Click here to reset