Bounds for codes and designs in complex subspaces |
| |
Authors: | Aidan Roy |
| |
Affiliation: | 1. Institute for Quantum Information Science & Department of Mathematics and Statistics, University of Calgary, Calgary, Alberta, T2N 1N4, Canada
|
| |
Abstract: | We introduce the concepts of complex Grassmannian codes and designs. Let $\mathcal{G}_{m,n}$ denote the set of m-dimensional subspaces of ? n : then a code is a finite subset of $\mathcal{G}_{m,n}$ in which few distances occur, while a design is a finite subset of $\mathcal{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, Bannai, Coulangeon and Nebe, and the bounds generalize those of Delsarte, Goethals and Seidel for codes and designs on the complex unit sphere. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|