Linear programming bounds for codes in Grassmannian spaces

Preprint

27 October 2006

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.math/0610812

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

CODES IN GRASSMANNIAN
GRASSMANNIAN SPACES
PROGRAMMING BOUNDS
LINEAR PROGRAMMING
HOMOGENEOUS SPACES
EXPLICIT BOUNDS
SPACES

All Related Versions

Version 1, 2006-10-27, ArXiv
Published version: IEEE Transactions on Information Theory, 52 (5), 2111.

This publication has 0 references indexed in Scilit: