A remark on 𝔽_q^n-Linear MRD codes

06/29/2021
by   Luca Giuzzi, et al.
0

In this note, we provide a description of the elements of minimum rank of a generalized Gabidulin code in terms of Grassmann coordinates. As a consequence, a characterization of linearized polynomials of rank at most n-k is obtained, as well as parametric equations for MRD-codes of distance d=n-k+1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2022

Antipodal two-weight rank metric codes

We consider the class of linear antipodal two-weight rank metric codes a...
research
10/05/2018

A note on spanoid rank

We construct a spanoid S on n elements with rank(S) > n^c f-rank(S) wher...
research
01/28/2017

Efficient Rank Aggregation via Lehmer Codes

We propose a novel rank aggregation method based on converting permutati...
research
01/20/2022

Non-minimum tensor rank Gabidulin codes

The tensor rank of some Gabidulin codes of small dimension is investigat...
research
10/15/2021

Linear maximum rank distance codes of exceptional type

Scattered polynomials of a given index over finite fields are intriguing...
research
04/05/2019

F_q^n-linear rank distance codes and their distinguishers

For any admissible value of the parameters there exist Maximum Rank dist...
research
05/09/2023

On the Minimum Distance of Subspace Codes Generated by Linear Cellular Automata

Motivated by applications to noncoherent network coding, we study subspa...

Please sign up or login with your details

Forgot password? Click here to reset