In this paper, we develop the linear programming method to obtain bounds for the cardinality of Grassmannian codes endowed with the chordal distance. We obtain a bound and its asymptotic version that generalize the well-known bound for codes in the real projective space obtained by Kabatyanskiy and Levenshtein, and improve the Hamming bound for sufficiently large minimal distances
No takes yet. Share an insight, caveat, or question.
Christine Bachoc (2006) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: