子空间的子空间覆盖
Covering of Subspaces by Subspaces
摘要:
讨论了Grassmann图$\cG_q(n,r)$中的子空间被Grassmann图$\cG_q(n,k)$中的子空间覆盖的大小的上下界,即$k \geq r$.这个问题是感兴趣的从四个角度来看:编码理论,组合设计,$q$ -类似物,和射影几何。特别是,我们检查覆盖的基础上提升的最大秩距离码,结合传播和递归建设。给出了$q=2$与$r=2$或$r=3$的新构造.我们讨论其中一些覆盖层的密度。表中列出了$q=2$和$5 \leq n \leq 10$的最佳覆盖物。我们提出了一些问题,可能的建设新的覆盖更小的尺寸。
英文摘要:
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding theory, combinatorial designs, $q$-analogs, and projective geometry. In particular we examine coverings based on lifted maximum rank distance codes, combined with spreads and a recursive construction. New constructions are given for $q=2$ with $r=2$ or $r=3$. We discuss the density for some of these coverings. Tables for the best known coverings, for $q=2$ and $5 \leq n \leq 10$, are presented. We present some questions concerning possible constructions of new coverings of smaller size.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。