A bound on Grassmannian codes
Information Theory
2019-05-14 v1 math.IT
Metric Geometry
Abstract
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.
Cite
@article{arxiv.cs/0512024,
title = {A bound on Grassmannian codes},
author = {Alexander Barg and Dmitry Nogin},
journal= {arXiv preprint arXiv:cs/0512024},
year = {2019}
}
Comments
5 pages, submitted