Sphere packing bounds in the Grassmann and Stiefel manifolds
arXiv:math/0308110 · doi:10.1109/TIT.2005.855594
Abstract
Applying the Riemann geometric machinery of volume estimates in terms of curvature, bounds for the minimal distance of packings/codes in the Grassmann and Stiefel manifolds will be derived and analyzed. In the context of space-time block codes this leads to a monotonically increasing minimal distance lower bound as a function of the block length. This advocates large block lengths for the code design.
Replaced with final version, 11 pages
References in corpus (1)
Cited by in corpus (18)
- Multiuser Diversity for Secrecy Communications Using Opportunistic Jammer Selection -- Secure DoF and Jammer Scaling Law
- Coherence Optimization and Best Complex Antipodal Spherical Codes
- Geometrical relations between space time block code designs and complexity reduction
- Global Optimization with Orthogonality Constraints via Stochastic Diffusion on Manifold
- Spherical Cap Packing Asymptotics and Rank-Extreme Detection
- Notes on microstate free entropy of projections
- Space Frequency Codes from Spherical Codes
- Normalized Volume of Hyperball in Complex Grassmann Manifold and Its Application in Large-Scale MU-MIMO Communication Systems
- From Random Matrix Theory to Coding Theory: Volume of a Metric Ball in Unitary Group
- On the rigidity of geometric and spectral properties of Grassmannian frames
- Unequal dimensional small balls and quantization on Grassmann Manifolds
- Maximal Orthoplectic Fusion Frames from Mutually Unbiased Bases and Block Designs
- Bounds for codes in products of spaces, Grassmann and Stiefel manifolds
- Asymptotic Analysis of Random Lattices in High Dimensions
- A Desired PAR-Achieving Precoder Design for Multi-User MIMO OFDM based on Concentration of Measure
- Volume of Metric Balls in High-Dimensional Complex Grassmann Manifolds
- Bayesian inference for PCA and MUSIC algorithms with unknown number of sources
- Space Time Codes from Permutation Codes