A Group-Theoretic Framework for the Construction of Packings in Grassmannian Spaces
Journal of Algebraic Combinatorics: An International Journal
Design of repeat-accumulate codes for iterative detection and decoding
IEEE Transactions on Signal Processing
Unitary space-time modulation via Cayley transform
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Quantum error correction via codes over GF(4)
IEEE Transactions on Information Theory
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
IEEE Transactions on Information Theory
Unitary space-time modulation for multiple-antenna communications in Rayleigh flat fading
IEEE Transactions on Information Theory
Nonbinary quantum stabilizer codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Multiple-antenna capacity in the low-power regime
IEEE Transactions on Information Theory
Recursive decoding and its performance for low-rate Reed-Muller codes
IEEE Transactions on Information Theory
Simple MAP decoding of first-order Reed-Muller and Hamming codes
IEEE Transactions on Information Theory
Greed is good: algorithmic results for sparse approximation
IEEE Transactions on Information Theory
Hi-index | 754.84 |
This paper introduces multidimensional generalizations of binary Reed-Muller codes where the codewords are projection operators, and the corresponding subspaces are widely separated with respect to the chordal distance on Grassmannian space. Parameters of these Grassmannian packings are derived and a low complexity decoding algorithm is developed by modifying standard decoding algorithms for binary Reed-Muller codes. The subspaces are associated with projection operators determined by Pauli matrices appearing in the theory of quantum error correction and this connection with quantum stabilizer codes may be of independent interest. The Grassmannian packings constructed here find application in noncoherent wireless communication with multiple antennas, where separation with respect to the chordal distance on Grassmannian space guarantees closeness to the channel capacity. It is shown that the capacity of the noncoherent multiple-input-multiple-output (MIMO) channel at both low and moderate signal-to-noise ratio (SNR) (under the constraint that only isotropically distributed unitary matrices are used for information transmission) is closely approximated by these packings.