On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity

DOI10.1109/TIT.2008.2011521MaRDI QIDQ4975763zbMATH OpenOpenAlexFDO

Authors

Publication date 8 August 2017

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

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

Mathematics Subject Classification ID

Combinatorial codes (94B25) Decoding (94B35)

Cited in

(4)

• Spatial block codes based on unitary transformations derived from orthonormal polynomial sets
• On the Minimum Decoding Delay of Balanced Complex Orthogonal Designs
• Optimal Normalized Diversity Product of 2\,\times\,2 Lattice-Based Diagonal Space–Time Codes From QAM Signal Constellations
• On low-complexity space-time coding for quasi-static channels

This page was built for publication: On Optimal Quasi-Orthogonal Space–Time Block Codes With Minimum Decoding Complexity

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