The DMT Classification of Real and Quaternionic Lattice Codes

Laura Luzzi, Roope Vehkalahti

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

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 mathbb Q-central division algebras satisfy this optimality criterion. As a corollary this result provides a DMT classification for all mathbb Q-central division algebra codes that are based on standard embeddings.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
PublisherIEEE
Pages1026-1030
Number of pages5
Volume2018-June
ISBN (Print)9781538647806
DOIs
Publication statusPublished - 15 Aug 2018
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Vail, United States
Duration: 17 Jun 201822 Jun 2018

Publication series

NameIEEE International Symposium on Information Theory
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountryUnited States
CityVail
Period17/06/201822/06/2018

Fingerprint Dive into the research topics of 'The DMT Classification of Real and Quaternionic Lattice Codes'. Together they form a unique fingerprint.

Cite this