Maximum Flag-Rank Distance Codes

03/29/2023
by   Gianira N. Alfarano, et al.
0

In this paper we extend the study of linear spaces of upper triangular matrices endowed with the flag-rank metric. Such metric spaces are isometric to certain spaces of degenerate flags and have been suggested as suitable framework for network coding. In this setting we provide a Singleton-like bound which relates the parameters of a flag-rank-metric code. This allows us to introduce the family of maximum flag-rank distance codes, that are flag-rank-metric codes meeting the Singleton-like bound with equality. Finally, we provide several constructions of maximum flag-rank distance codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/24/2021

Decoding a class of maximum Hermitian rank metric codes

Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 a...
research
07/11/2019

On some automorphisms of rational functions and their applications in rank metric codes

Recently, there is a growing interest in the study of rank metric codes....
research
01/27/2020

Connections between scattered linear sets and MRD-codes

The aim of this paper is to survey on the known results on maximum scatt...
research
04/07/2021

Valued rank-metric codes

In this paper, we study linear spaces of matrices defined over discretel...
research
07/12/2023

Better bounds on the minimal Lee distance

This paper provides new and improved Singleton-like bounds for Lee metri...
research
04/02/2018

Maximal Ferrers Diagram Codes: Constructions and Genericity Considerations

This paper investigates the construction of rank-metric codes with speci...
research
11/13/2020

On symmetric and Hermitian rank distance codes

Let M denote the set S_n, q of n × n symmetric matrices with entries in ...

Please sign up or login with your details

Forgot password? Click here to reset