Title of article
A bound on Grassmannian codes
Author/Authors
Barg، نويسنده , , Alexander and Nogin، نويسنده , , Dmitry، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
7
From page
1629
To page
1635
Abstract
We derive a new upper bound on the size of a code in the Grassmannian space equipped with a chordal distance. The bound is asymptotically better than the upper bounds known previously in the entire range of distances except very large values.
Keywords
Blichfeldtיs method , Isometric embedding , Spherical cap , Chordal distance
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2006
Journal title
Journal of Combinatorial Theory Series A
Record number
1531140
Link To Document