A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound. Our approach generalizes the approach originally developed by P. Delsarte and Kabatianski-Levenshtein for compact two-point homogeneous spaces.doi:10.1109/tit.2006.872973 fatcat:7nocxa2vencyfcpjr6jbqvpfqy