Density and bounds for Grassmannian codes with chordal distance

Abstract

We investigate the density of codes in the complex Grassmann manifolds G<sup>&#x2102;</sup><inf>n,p</inf> equipped with the chordal distance. The density of a code is defined as the fraction of the Grassmannian covered by &#x2018;kissing&#x2019; balls of equal radius centered around the codewords. The kissing radius cannot be determined solely from the… (More)
DOI: 10.1109/ISIT.2011.6033971

Topics

4 Figures and Tables

Statistics

0102030201520162017
Citations per Year

Citation Velocity: 6

Averaging 6 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Pitaval2011DensityAB, title={Density and bounds for Grassmannian codes with chordal distance}, author={Renaud-Alexandre Pitaval and Olav Tirkkonen and Steven D. Blostein}, journal={2011 IEEE International Symposium on Information Theory Proceedings}, year={2011}, pages={2298-2302} }