A bound on Grassmannian codes

Authors:
Alexander Barg;Dmitry Nogin
Affiliations:
Department of ECE and Institute for Systems Research, University of Maryland, College Park, MD;IPPI RAN, Bol'shoj Karetnyj, Moscow, Russia
Venue:
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Year:
2006

Citing 6
Cited 1

A Family of Optimal Packings in Grassmannian Manifolds

Journal of Algebraic Combinatorics: An International Journal
The Geometry of Algorithms with Orthogonality Constraints

SIAM Journal on Matrix Analysis and Applications
Introduction to Coding Theory

Introduction to Coding Theory
Multiple-antenna signal constellations for fading channels

IEEE Transactions on Information Theory
Bounds on packings of spheres in the Grassmann manifold

IEEE Transactions on Information Theory
Linear programming bounds for codes in grassmannian spaces

IEEE Transactions on Information Theory

A survey on spherical designs and algebraic combinatorics on spheres

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive a new upper bound on the size of a code in the Grassmannian space equipped with a chordal distance. The bound is asymptotically better than the upper bounds known previously in the entire range of distances except very large values.