Perfect Space–Time Codes for Any Number of Antennas

DOI10.1109/TIT.2007.907502MaRDI QIDQ3548989zbMATH OpenOpenAlexFDO

Authors Petros E. Elia, B. A. Sethuraman, P. Vijay Kumar

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2007.907502

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29)

Cited in

(7)

• Natural orders for asymmetric space-time coding: minimizing the discriminant
• On the construction of perfect codes from \textit{HEX} signal constellations
• Rotated \(A_n \)-lattice codes of full diversity
• On fast-decodable algebraic space-time codes
• Constructions of rotated lattice constellations in dimensions power of 3
• Fractional non-norm elements for division algebras, and an application to cyclic learning with errors
• Mathematics of digital communications: from finite fields to group rings and noncommutative algebra

This page was built for publication: Perfect Space–Time Codes for Any Number of Antennas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548989)