| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656605 | Journal of Combinatorial Theory, Series A | 2006 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
