Name
Abstract | ||
|---|---|---|
Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimum chordal distance. They stem from upper bounds for codes in the product of unit spheres and projective spaces. The new bounds are asymptotically better than the previously known ones. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/TIT.2007.915916 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
codes,linear programming,Grassmann manifold,Stiefel manifold,codes,linear programming,minimum chordal distance,Coding theory,Grassman manifold,Stiefel manifold,minimum distance,multiple-input multiple output (MIMO),space–time codes,spherical codes | Information theory,Discrete mathematics,Combinatorics,Polynomial,Upper and lower bounds,Stiefel manifold,Coding theory,Grassmannian,Mathematics,Manifold,Projective space | Journal |
Volume | Issue | ISSN |
54 | 3 | 0018-9448 |
Citations | PageRank | References |
6 | 0.50 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Bachoc | 1 | 6 | 0.50 |
| Y. Ben-Haim | 2 | 140 | 8.29 |
| S. Litsyn | 3 | 602 | 50.31 |