The DMT classification of real and quaternionic lattice codes
Information Theory
2018-01-10 v1 math.IT
Number Theory
Abstract
In this paper we consider space-time codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for a lattice code to achieve these upper bounds. We also point out that lattice codes based on Q-central division algebras satisfy this optimality criterion. As a corollary this result provides a DMT classification for all Q-central division algebra codes that are based on standard embeddings.
Cite
@article{arxiv.1801.02913,
title = {The DMT classification of real and quaternionic lattice codes},
author = {Laura Luzzi and Roope Vehkalahti},
journal= {arXiv preprint arXiv:1801.02913},
year = {2018}
}
Comments
6 pages, 1 figure. Conference paper submitted to the International Symposium on Information Theory 2018