Linear programming bounds for codes in Grassmannian spaces
Idioma
en
Article de revue
Este ítem está publicado en
IEEE Transactions on Information Theory. 2006, vol. 52, n° 5, p. 2111-2125
Institute of Electrical and Electronics Engineers
Resumen en inglés
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. ...Leer más >