A bound on Grassmannian codes
classification
💻 cs.IT
math.ITmath.MG
keywords
boundgrassmannianupperasymptoticbetterboundscodecodes
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.