In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at most, two relevant constant dimension codes naturally associated to them. We do this first for general flag codes and then particularize to those arising as orbits under the action of arbitrary subgroups of the general linear group. We provide two different systematic orbital constructions of flag codes attaining both maximum distance and size. To this end, we use the action of Singer groups and take advantage of the good relation between these groups and Desarguesian spreads, as well as the fact that they act transitively on lines and hyperplanes.
翻译:在本文中,我们研究最大距离的旗帜编码,我们将这些编码最多用自然相关的两个相关常数编码来描述,我们首先研究一般旗帜编码,然后专门研究在一般线性组的任意分组行动下产生的轨道;我们提供两种不同系统的轨道结构的旗帜编码,既能达到最大距离,又能达到最大距离;为此,我们利用Singer集团的行动,利用这些集团与Desarguesian扩散之间的良好关系,以及它们在线上和超高平面上过境。