A bound on Grassmannian codes

TL;DR

This paper presents a new asymptotic upper bound on the size of codes in Grassmannian spaces, improving previous bounds across most distance ranges.

Contribution

It introduces a novel asymptotic upper bound on Grassmannian codes that surpasses existing bounds in nearly all distance regimes.

Findings

New asymptotic upper bound established

Bound improves upon previous results in most distance ranges

Enhances understanding of Grassmannian code limitations

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.