2018/01/09 by Laura Luzzi, Luzzi, Laura, Roope Vehkalahti +1
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1801.02913
openalex publication_date 2018/01/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.