Cyclic orbit flag codes

DOI10.1007/S10623-021-00920-5MaRDI QIDQ2232124zbMATH OpenOpenAlexFDO

Authors Clementa Alonso-González, Miguel Ángel Navarro-Pérez

Publication date 4 October 2021

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

Full work available at URL https://arxiv.org/abs/2102.00867, http://hdl.handle.net/10045/117445

cyclic orbit flag codes flag codes network coding

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite geometry and special incidence structures (51E99) Other types of codes (94B60)

Abstract: In network coding, a flag code is a set of sequences of nested subspaces of

m a t h b b F_{q}^{n}

, being

m a t h b b F_{q}

the finite field with

q

elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on flags of

m a t h b b F_{q}^{n}

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.

Review text

Flag codes are a generalization of constant dimension subspace codes, and they have application in multishot network coding. A degree \(n\) extension of finite fields is considered, namely \(\mathbb F_{q^n}/\mathbb F_{q}\). A flag \(\mathcal F=(\mathcal F_1,\ldots,\mathcal F_r)\) is a sequence of nested \(\mathbb F_{q}\)-subspaces \[\{0\}\subsetneq \mathcal F_1 \subsetneq \ldots \subsetneq \mathcal F_r \subsetneq \mathbb F_{q^n}, \] whose type is \((\dim_{\mathbb F_{q}}(\mathcal F_1),\ldots,\dim_{\mathbb F_{q}}(\mathcal F_r))\). For two flags of the same type \((t_1,\ldots,t_r)\), the flag distance is \[d_f(\mathcal F, \mathcal F')=2\Big(\sum_{i=1}^rt_i-\dim_{\mathbb F_{q}}(\mathcal F_i\cap \mathcal F_i') \Big).\] Finally, a flag code is a set of flags of the same type endowed with the flag distance. In this paper, the authors study cyclic orbit flag codes. These are sets of flags corresponding to orbits of the action of subgroups of \(\mathbb F_{q^n}^*\) on the set of all the flags of a given type. They analyze the notions of stabilizer subfield and best friends of a flag and use them for studying two special classes of flag codes: Galois cyclic flag codes, that are cyclic orbit codes generated by a sequence of nested subfields and optimum distance cyclic orbit flag codes, i.e. cyclic orbit flag codes attaining the best possible minimum distance. The paper is very well-written and clear. The proofs are correct and understandable and the techniques used are mainly based on linear algebra, finite fields and group theory.

Recommendations

Cites work

Cited in

(12)

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)