In this paper we study flag codes on Fnq, being Fq 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.
network coding; flag codes; constant dimension codes; equidistant codes; sunflowers