Optimum Distance Cyclic H-Orbit Full Flag Codes

Date

2025-01-01

Author

Karakas, Zeynelabidin
Özbudak, Ferruh
Özkaya, Buket

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

74
views

9
downloads

Cite This

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 (Formula presented) of order at most (Formula presented). 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.

Subject Keywords

Flag Codes, Orbit Flag Codes, Subspace Codes

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=105021880105&origin=inward
https://hdl.handle.net/11511/116953

Collections

Graduate School of Applied Mathematics, Article