Algebraic lattice constellations: bounds on performance

Abstract

In this work, we give a bound on performance of any full-diversity lattice constellation constructed from algebraic number fields. We show that most of the already available constructions are almost optimal in the sense that any further improvement of the minimum product distance would lead to a negligible coding gain. Furthermore, we discuss constructions… (More)
DOI: 10.1109/TIT.2005.860452

Topics

4 Figures and Tables

Cite this paper

@article{BayerFluckiger2006AlgebraicLC, title={Algebraic lattice constellations: bounds on performance}, author={E. Bayer-Fluckiger and Fr{\'e}d{\'e}rique E. Oggier and Emanuele Viterbo}, journal={IEEE Transactions on Information Theory}, year={2006}, volume={52}, pages={319-327} }