Finding maximal orders in semisimple algebras over Q
Computational Complexity
Space-time codes from structured lattices
IEEE Transactions on Information Theory
On the densest MIMO lattices from cyclic division algebras
IEEE Transactions on Information Theory
Construction methods for asymmetric and multiblock space-time codes
IEEE Transactions on Information Theory
Dense MIMO matrix lattices: a meeting point for class field theory and invariant theory
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras
IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Maximal Orders in the Design of Dense Space-Time Lattice Codes
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
The paper considers the question of the normalized minimum determinant (or asymptotic coding gain) of real matrix lattices. The coding theoretic motivation for such study arises, for example, from the questions considering multiple-input multiple-output (MIMO) ultra-wideband (UWB) transmission. At the beginning, totally general coding gain bounds for real MIMO lattice codes is given by translating the problem into geometric language. Then code lattices that are produced from division algebras are considered. By applying methods from the theory of central simple algebras, coding gain bounds for code lattices coming from orders of division algebras are given. Finally, it is proven that these bounds can be reached by using maximal orders. In the case of 2 × 2 matrix lattices, this existence result proves that the general geometric bound derived earlier can be reached.