2020/11/05 by Alonso-González, Clementa, Navarro-Pérez, Miguel Ángel, Soler-Escrivà, Xaro · 1 citation
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2011.02724
Flag codes are multishot network codes consisting of sequences of nested subspaces (flags) of a vector space \mathbbFqn, where q is a prime power and \mathbbFq, the finite field of size q. In this paper we study the construction on \mathbbFq2k of full flag codes having maximum distance (optimum distance full flag codes) that can be endowed with an orbital structure provided by the action of a subgroup of the general linear group. More precisely, starting from a subspace code of dimension k and maximum distance with a given orbital description, we provide sufficient conditions to get an optimum distance full flag code on \mathbbFq2k having an orbital structure directly induced by the previous one. In particular, we exhibit a specific orbital construction with the best possible size from an orbital construction of a planar spread on \mathbbFq2k that strongly depends on the characteristic of the field.