2020/11/05 by Clementa Alonso-González, Alonso-González, Clementa, Miguel Ángel Navarro-Pérez +1
Computer Science · Engineering · #Advanced Wireless Communication Technologies #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2011.02734
openalex publication_date 2020/11/05 · openalex created_date 2022/09/30 · openalex updated_date 2026/08/01
In this paper we study flag codes on \mathbbFqn, being \mathbbFq the finite field with q elements. Special attention is given to the connection between the parameters and properties of a flag code and the ones of a family of constant dimension codes naturally associated to it (the projected codes). More precisely, we focus on consistent flag codes, that is, flag codes whose distance and size are completely determined by their projected codes. We explore some aspects of this family of codes and present examples of them by generalizing the concepts of equidistant and sunflower subspace code to the flag codes setting. Finally, we present a decoding algorithm for consistent flag codes that fully exploits the consistency condition.