New MRD codes from linear cutting blocking sets

09/06/2022
by   Daniele Bartoli, et al.
0

Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated q-system. Using this result, we provide the first construction of a family of 𝔽_q^m-linear MRD codes of length 2m that are not obtained as a direct sum of two smaller MRD codes. In addition, such a family has better parameters, since its codes possess generalized rank weights strictly larger than those of the previously known MRD codes. This shows that not all the MRD codes have the same generalized rank weights, in contrast to what happens in the Hamming metric setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2021

Linear Cutting Blocking Sets and Minimal Codes in the Rank Metric

This work investigates the structure of rank-metric codes in connection ...
research
12/22/2021

Two pointsets in PG(2,q^n) and the associated codes

In this paper we consider two pointsets in PG(2,q^n) arising from a line...
research
11/22/2019

Full Characterization of Minimal Linear Codes as Cutting Blocking Sets

In this paper, we first study more in detail the relationship between mi...
research
07/09/2019

A Geometric Approach to Rank Metric Codes and a Classification of Constant Weight Codes

In this work we develop a geometric approach to the study of rank metric...
research
09/27/2022

Clubs and their applications

Clubs of rank k are well-celebrated objects in finite geometries introdu...
research
07/13/2023

Integer sequences that are generalized weights of a linear code

Which integer sequences are sequences of generalized weights of a linear...
research
01/19/2022

Quasi optimal anticodes: structure and invariants

It is well-known that the dimension of optimal anticodes in the rank-met...

Please sign up or login with your details

Forgot password? Click here to reset