A bound on Grassmannian codes
arXiv:cs/0512024 · doi:10.1016/j.jcta.2006.03.025
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.
5 pages, submitted