Spectral approach to linear programming bounds on codes

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 values

[1]  Alan Edelman,et al.  The Geometry of Algorithms with Orthogonality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[2]  T.J. Richardon,et al.  Multiple-antenna signal constellations for fading channels , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[3]  Alexander Barg,et al.  Bounds on packings of spheres in the Grassmann manifold , 2002, IEEE Trans. Inf. Theory.

[4]  N. Sloane,et al.  A Family of Optimal Packings in Grassmannian Manifolds , 1998, math/0208003.

[5]  N. J. A. Sloane,et al.  Packing Lines, Planes, etc.: Packings in Grassmannian Spaces , 1996, Exp. Math..

[6]  R. Rankin.  The Closest Packing of Spherical Caps in n Dimensions , 1955, Proceedings of the Glasgow Mathematical Association.