arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0806.2317math.CO
收藏

复子空间中码和设计的界

Bounds for codes and designs in complex subspaces

Aidan Roy

摘要:

我们介绍了复杂的格拉斯曼码和设计的概念。设G(m,n)表示C^n的m维子空间的集合:则码是G(m,n)的一个有限子集,其中出现很少的距离,而设计是G(m,n)的一个有限子集,多项式逼近整个集合。使用Delsarte的线性规划技术,我们发现上界的大小的代码和下界的大小的设计,我们表明,关联计划可以发生时,边界是紧的。这些结果的动机是最近发现的Bachoc,Coulangeon和Nebe的实子空间的界限,和范围推广的Delsarte,Goethals和Seidel的代码和设计的复杂单位球。

英文摘要:

We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of G(m,n) that polynomially approximates the entire set. Using Delsarte's linear programming techniques, we find upper bounds for the size of a code and lower bounds for the size of a design, and we show that association schemes can occur when the bounds are tight. These results are motivated by the bounds for real subspaces recently found by Bachoc, Coulangeon and Nebe, and the bounds generalize those of Delsarte, Goethals and Seidel for codes and designs on the complex unit sphere.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑