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

zbMATH Keywords

network codingflag codescyclic orbit flag codes

Mathematics Subject Classification ID

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

Abstract: In network coding, a flag code is a set of sequences of nested subspaces of $mathbb{F}_q^n$, being $mathbb{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 $mathbb{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.

Recommendations

• An orbital construction of optimum distance flag codes
• Cyclic orbit codes and stabilizer subfields
• Flag codes of maximum distance and constructions using Singer groups
• Flag codes from planar spreads in network coding
• Distance distributions of cyclic orbit codes

Cites work

• A Random Linear Network Coding Approach to Multicast
• A characterization of cyclic subspace codes via subspace polynomials
• A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
• An algebraic approach for decoding spread codes
• An orbital construction of optimum distance flag codes
• Coding for Errors and Erasures in Random Network Coding
• Construction of Sidon spaces with applications to coding
• Constructions of cyclic constant dimension codes
• Cyclic Orbit Codes
• Cyclic orbit codes and stabilizer subfields
• Cyclic subspace codes via subspace polynomials
• Distance distributions of cyclic orbit codes
• Error-Correcting Codes in Projective Space
• Flag codes from planar spreads in network coding
• Network coding with flags
• Network information flow
• On the orbits of Singer groups and their subgroups
• Spread decoding in extension fields
• Subspace Polynomials and Cyclic Subspace Codes
• Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane

Cited in

(9)

• Constructions of optimum distance full flag codes
• Maximum flag-rank distance codes
• Network coding with flags
• An orbital construction of optimum distance flag codes
• Equivalence for flag codes
• Submodule codes as spherical codes in buildings
• Degenerate flag varieties in network coding
• Cyclic orbit codes and stabilizer subfields
• Flag codes of maximum distance and constructions using Singer groups

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)