A bound on Grassmannian codes
  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. 
Alexander Barg and Dmitry Nogin