Title :
Linear programming bounds for codes in grassmannian spaces
Author :
Bachoc, Christine
Author_Institution :
Lab. A2X, Inst. de Math. de Bordeaux, Talence
fDate :
5/1/2006 12:00:00 AM
Abstract :
In this paper, we develop the linear programming method to obtain bounds for the cardinality of Grassmannian codes endowed with the chordal distance. We obtain a bound and its asymptotic version that generalize the well-known bound for codes in the real projective space obtained by Kabatyanskiy and Levenshtein, and improve the Hamming bound for sufficiently large minimal distances
Keywords :
Hamming codes; linear programming; Grassmannian code; Hamming bound; asymptotic version; chordal distance; linear programming method; real projective space; Eigenvalues and eigenfunctions; Galois fields; Information theory; Jacobian matrices; Linear programming; Polynomials; Space time codes; Upper bound; Bounds; Grassmann manifold; chordal distance; codes; linear programming method; zonal functions;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2006.872973
