A bound on Grassmannian codes
<|reference_start|>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.<|reference_end|>
@article{barg2005a,
    title={A bound on Grassmannian codes},
    author={Alexander Barg and Dmitry Nogin},
    journal={Journal of Combinatorial Theory, Ser. A, vol.113,no.8, 2006,
  pp.1629-1635},
    year={2005},
    doi={10.1016/j.jcta.2006.03.025},
    archivePrefix={arXiv},
    eprint={cs/0512024},
    primaryClass={cs.IT math.IT math.MG}
}