Flag codes of maximum distance and constructions using Singer groups

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Spreads and packing problems in finite geometry (51E23) Other types of codes (94B60)

Abstract: 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.

Review text

Let \({\mathbb F}_q^n\) denote the \(n\)-dimensional vector space over \({\mathbb F}_q\). A \textit{subspace code} is a collection of subspaces of \({\mathbb F}_q^n\). Subspace codes are used in network coding. If all the subspaces in a subspace code have the same dimension, then it is called a \textit{constant dimension code}. A \textit{flag code} is a generalization of a subspaces code in which the subspaces are replaced by flags (nested subspaces) of \({\mathbb F}_q^n\). Flag codes were introduced by \textit{D. Liebhold} et al. [Des. Codes Cryptography 86, No. 2, 269--284 (2018; Zbl 1412.94254)] and further studied by several other authors. In particular, \textit{C. Alonso-González} et al. [Finite Fields Appl. 68, Article ID 101745, 20 p. (2020; Zbl 1464.94081)] characterized the \textit{Optimum Distance Flag Codes} (ODFC), which are flag codes with maximum possible distance. They proved that a flag code is an ODFC if and only if every \(i\)-projected code (corresponding to the subspaces at position \(i\) in the flags) is a constant dimension code with the maximum possible distance. In this paper under review, the authors proved a characterization of ODFC that generalizes the above-mentioned characterization of Alonso-González et al. [loc. cit.]. They also provide further characterizations and constructions of ODFC codes that arise as orbits under the action of subgroups (mainly Singer subgroups) of \(\mathrm{GL}(n,q)\).

Recommendations

Cites work

Cited in

(14)

This page was built for publication: Flag codes of maximum distance and constructions using Singer groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2123306)