Cyclic orbit flag codes

From MaRDI portal
Publication:2232124

DOI10.1007/S10623-021-00920-5zbMATH Open1478.94142arXiv2102.00867OpenAlexW3197520383MaRDI QIDQ2232124FDOQ2232124


Authors: Clementa Alonso-González, Miguel Ángel Navarro-Pérez Edit this on Wikidata


Publication date: 4 October 2021

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: In network coding, a flag code is a set of sequences of nested subspaces of mathbbFqn, being mathbbFq the finite field with q elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on flags of mathbbFqn are called cyclic orbit flag codes. Inspired by the ideas in arXiv:1403.1218, we determine the cardinality of a cyclic orbit flag code and provide bounds for its distance with the help of the largest subfield over which all the subspaces of a flag are vector spaces (the best friend of the flag). Special attention is paid to two specific families of cyclic orbit flag codes attaining the extreme possible values of the distance: Galois cyclic orbit flag codes and optimum distance cyclic orbit flag codes. We study in detail both classes of codes and analyze the parameters of the respective subcodes that still have a cyclic orbital structure.


Full work available at URL: https://arxiv.org/abs/2102.00867




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Cyclic orbit flag codes

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