Linear programming bounds for codes in Grassmannian spaces
Language
en
Article de revue
This item was published in
IEEE Transactions on Information Theory. 2006, vol. 52, n° 5, p. 2111-2125
Institute of Electrical and Electronics Engineers
English Abstract
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. ...Read more >
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.Read less <
Origin
Hal imported