A bound on Grassmannian codes

We derive a new upper bound on the size of a code in the Grassmannian space equipped with a chordal distance. The bound is asymptotically better than the upper bounds known previously in the entire range of distances except very large values.