On the existence of perfect space-time codes

Authors:
Grégory Berhuy;Frédérique Oggier
Affiliations:
School of Mathematics, University of Southampton, Southampton, UK;California Institute of Technology, Pasadena, CA
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 4
Cited 0

Space-time codes for high data rate wireless communication: performance criterion and code construction

IEEE Transactions on Information Theory
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

IEEE Transactions on Information Theory
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff

IEEE Transactions on Information Theory
Perfect Space–Time Block Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

Perfect space-time codes are codes for the coherent multiple-input multiple-output (MIMO) channel. They have been called so since they satisfy a large number of design criteria that makes their performances outmatch many other codes. In this correspondence, we discuss the existence of such codes (or more precisely, the existence of perfect codes with optimal signal complexity).