基于图中完美匹配的最佳距离标志码
Optimum Distance Flag Codes from Spreads via Perfect Matchings in Graphs
摘要：
本文研究了向量空间$\mathbb{F}_q^n$上的标志码，其中$q$是素数幂，$\mathbb{F}_q$是$q$元素的有限域.更准确地说，我们专注于标志码，达到最大可能的距离（最佳距离标志码），可以从$\mathbb{F}_q^n$的扩展。我们的特点是这一系列的标志码的容许型向量，并提供了一个建设他们的基础上著名的结果完美匹配图。这种构造获得了其类型向量的最大距离和该距离的最大可能基数。
英文摘要：
In this paper, we study flag codes on the vector space $\mathbb{F}_q^n$, being $q$ a prime power and $\mathbb{F}_q$ the finite field of $q$ elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum distance flag codes) and can be obtained from a spread of $\mathbb{F}_q^n$. We characterize the set of admissible type vectors for this family of flag codes and also provide a construction of them based on well-known results about perfect matchings in graphs. This construction attains both the maximum distance for its type vector and the largest possible cardinality for that distance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
