A bound on Grassmannian codes
Abstract
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2005
- DOI:
- arXiv:
- arXiv:cs/0512024
- Bibcode:
- 2005cs.......12024B
- Keywords:
-
- Computer Science - Information Theory;
- Mathematics - Metric Geometry
- E-Print:
- 5 pages, submitted