Linear programming bounds for codes in Grassmannian spaces
Combinatorics
2016-11-18 v1
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. Our approach generalizes the approach originally developed by P. Delsarte and Kabatianski-Levenshtein for compact two-point homogeneous spaces.
Keywords
Cite
@article{arxiv.math/0610812,
title = {Linear programming bounds for codes in Grassmannian spaces},
author = {Christine Bachoc},
journal= {arXiv preprint arXiv:math/0610812},
year = {2016}
}
Comments
35 pages, 1 figure