Optimum Distance Cyclic H -Orbit Full Flag Codes
Open Access
- 12 November 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 194149-194155
Abstract
Flag codes, introduced as a special class of nested subspace codes, have recently attracted significant attention in the research community. In this work, we present constructions of optimum-distance cyclic H-orbit full flag codes, where H is a cyclic subgroup of F∗qn of order at most qn/2 + 1. Our aim is to extend certain results from [10] to the framework of flag codes. The proposed constructions, unlike the work [4], achieve full flags with optimum distance and either maximal or best-possible size, depending on the parity of the base field. We also provide explicit examples that demonstrate the structure of our codes. Furthermore, for the case of even base field size, we prove -via intricate arithmetical arguments- that our construction is unique under certain conditions.Keywords
Funding Information
- Scientific and Technological Research Council of Türkiye (223N065)
This publication has 14 references indexed in Scilit:
- Optimal full-length cyclic orbit flag codes2024
- Optimum distance flag codes from spreads via perfect matchings in graphsJournal of Algebraic Combinatorics, 2021
- Bounds for flag codesDesigns, Codes and Cryptography, 2021
- Flag codes from planar spreads in network codingFinite Fields and Their Applications, 2020
- Constructions of Constant Dimension Codes2018
- Network Coding and Subspace Designs2018
- Network coding with flagsDesigns, Codes and Cryptography, 2017
- Multishot codes for network coding: Bounds and a multilevel construction2009
- Network information flowIEEE Transactions on Information Theory, 2000
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997