A bound on Grassmannian codes
- 1 July 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 997-1000
- https://doi.org/10.1109/isit.2006.261877
Abstract
We derive a new upper bound on the size of a code in the Grassmannian space. The bound is asymptotically better than the upper bounds known previously in the entire range of distances except very large valuesKeywords
This publication has 10 references indexed in Scilit:
- Linear programming bounds for codes in grassmannian spacesIEEE Transactions on Information Theory, 2006
- On beamforming with finite rate feedback in multiple-antenna systemsIEEE Transactions on Information Theory, 2003
- Bounds on packings of spheres in the Grassmann manifoldIEEE Transactions on Information Theory, 2002
- Multiple-antenna signal constellations for fading channelsIEEE Transactions on Information Theory, 2001
- The Geometry of Algorithms with Orthogonality ConstraintsSIAM Journal on Matrix Analysis and Applications, 1998
- A Family of Optimal Packings in Grassmannian ManifoldsJournal of Algebraic Combinatorics, 1998
- Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExperimental Mathematics, 1996
- Formulas for Elementary Spherical Functions and Generalized Jacobi PolynomialsSIAM Journal on Mathematical Analysis, 1984
- The Closest Packing of Spherical Caps in n DimensionsProceedings of the Glasgow Mathematical Association, 1955
- Normal Multivariate Analysis and the Orthogonal GroupThe Annals of Mathematical Statistics, 1954