Linear programming bounds for codes in grassmannian spaces
- 24 April 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 52 (5) , 2111-2125
- https://doi.org/10.1109/tit.2006.872973
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 distancesKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Codes and designs in Grassmannian spacesDiscrete Mathematics, 2004
- Bounds on packings of spheres in the Grassmann manifoldIEEE Transactions on Information Theory, 2002
- Designs in Grassmannian Spaces and LatticesJournal of Algebraic Combinatorics, 2002
- Orthogonal Polynomials of Several VariablesPublished by Cambridge University Press (CUP) ,2001
- Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExperimental Mathematics, 1996
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spacesIEEE Transactions on Information Theory, 1995
- Aspects of Multivariate Statistical TheoryPublished by Wiley ,1982
- Positivity Proofs for Linearization and Connection Coefficients of Orthogonal Polynomials Satisfying an Addition FormulaJournal of the London Mathematical Society, 1978
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Transactions on Information Theory, 1977
- Generalized Jacobi Polynomials as Spherical Functions of the Grassmann ManifoldProceedings of the London Mathematical Society, 1974