Zeynelabidin Karakaş
Zeynelabidin Karakaş has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Buket Özkaya
Institute of Applied Mathematics, Middle East Technical University, Ankara, Turkey
1 shared publication - Ferruh Özbudak
FENS, Sabancı University, Istanbul, Turkey
1 shared publication
Latest Publications
- Open Access
- 12 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 194149-194155
Optimum Distance Cyclic H -Orbit Full Flag Codes
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.
- 12 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 194149-194155
Open AccessOptimum Distance Cyclic H -Orbit Full Flag Codes
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.