2023/11/10 by Navarro-Pérez, Miguel Ángel, Soler-Escrivà, Xaro
#11T71 #20B25 #51E20 #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2311.06060
Given a finite field Fq and a positive integer n, a flag is a sequence of nested Fq-subspaces of a vector space Fqn and a flag code is a nonempty collection of flags. The projected codes of a flag code are the constant dimension codes containing all the subspaces of prescribed dimensions that form the flags in the flag code. In this paper we address the notion of equivalence for flag codes and explore in which situations such an equivalence can be reduced to the equivalence of the corresponding projected codes. In addition, this study leads to new results concerning the automorphism group of certain families of flag codes, some of them also introduced in this paper.