Learn More
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. the problem of estimating the number of planes whose pairwise distances are bounded below by some given value δ, for a suitably defined distance function(More)