A Quasi-Random Approach to Space–Time Codes

DOI10.1109/TIT.2007.915889zbMATH Open1311.94047OpenAlexW2109884190MaRDI QIDQ3604591FDOQ3604591

Authors: Keying Y. Wu, Li Ping 

Publication date: 24 February 2009

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

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

Recommendations

• A quasi-orthogonal space-time block code
• On low-complexity space-time coding for quasi-static channels
• Space-time block codes from orthogonal designs
• Space-time block codes: a maximum SNR approach
• Signal constellations for quasi-orthogonal space-time block codes with full diversity

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Cited In (9)

• On the capacity of certain space-time coding schemes
• Existence and construction of noncoherent unitary space-time codes
• The Golden Code: A<tex>$2,times,2$</tex>Full-Rate Space–Time Code With Nonvanishing Determinants
• On the Existence of Perfect Space–Time Codes
• Complete Characterization of the Equivalent MIMO Channel for Quasi-Orthogonal Space–Time Codes
• Application of Randomization Techniques to Space-Time Convolutional Codes
• On low-complexity space-time coding for quasi-static channels
• An Optimal Two Transmit Antenna Space–Time Code and its Stacked Extensions
• Title not available (Why is that?)

This page was built for publication: A Quasi-Random Approach to Space–Time Codes

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