New Constructions of Full Flag Codes Based on Partial Spreads

Flag codes are a class of multishot network codes comprising sequences of nested subspaces (flags) within the vector space Fqⁿ, where q is a prime power. In this paper, we propose a family of constructions for full flag codes based on partial spreads. The distances of this family include maximum distance (optimum distance flag codes), second-maximum distance (quasi-optimum distance flag codes), as well as other feasible values. The structure of these flag codes resembles that of a sandwich", consisting of one layer of companion matrix and two layers of partial spreads. Furthermore, we present an efficient decoding algorithm for these codes.