Linear programming bounds for codes in grassmannian spaces

Authors:
C. Bachoc
Affiliations:
Lab. A2X, Inst. de Math. de Bordeaux, Talence
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

A bound on Grassmannian codes

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps

European Journal of Combinatorics
A survey on spherical designs and algebraic combinatorics on spheres

European Journal of Combinatorics
Unitary designs and codes

Designs, Codes and Cryptography
Bounds for codes and designs in complex subspaces

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	754.84

Visualization

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