Flag codes of maximum distance and constructions using Singer groups

In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at most, two relevant constant dimension codes naturally associated to them. We do this first for general flag codes and then particularize to those arising as orbits under the action of arbitrary subgroups of the general linear group. We provide two different systematic orbital constructions of flag codes attaining both maximum distance and size. To this end, we use the action of Singer groups and take advantage of the good relation between these groups and Desarguesian spreads, as well as the fact that they act transitively on lines and hyperplanes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2021

The interplay of different metrics for the construction of constant dimension codes

A basic problem for constant dimension codes is to determine the maximum...
research
03/08/2023

Error Correcting Codes From General Linear Groups

The parameters of the AG codes on general linear groups are found. The h...
research
01/15/2018

New LMRD bounds for constant dimension codes and improved constructions

We generalize upper bounds for constant dimension codes containing a lif...
research
04/29/2020

Lifted codes and the multilevel construction for constant dimension codes

Constant dimension codes are e.g. used for error correction and detectio...
research
11/05/2020

An Orbital Construction of Optimum Distance Flag Codes

Flag codes are multishot network codes consisting of sequences of nested...
research
08/05/2023

High-dimensional Expansion of Product Codes is Stronger than Robust and Agreement Testability

We study the coboundary expansion property of product codes called produ...
research
10/23/2018

Perfect Codes for Generalized Deletions from Minuscule Elements of Weyl Groups

This paper discusses a connection between insertion/deletion (ID) codes ...

Please sign up or login with your details

Forgot password? Click here to reset