Linear programming bounds for codes in Grassmannian spaces

Details Linear programming bounds for codes in Grassmannian spaces Linear programming bounds for codes in Grassmannian spaces

2006-10-26

arxiv.org/abs/math/0610812v1

IEEE Trans. Inf. Th., 52-5 (2006), 2111-2125

Mathematics

Combinatorics

35 pages, 1 figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Linear programming bounds for codes in Grassmannian spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear programming bounds for codes in Grassmannian spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear programming bounds for codes in Grassmannian spaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169502