Linear programming bounds for codes in grassmannian spaces

C. Bachoc
2006 IEEE Transactions on Information Theory  
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