On a conjecture about linear processing complex orthogonal designs

DOI10.1007/S41980-021-00625-4OpenAlexW4210589164WikidataQ113890900 ScholiaQ113890900MaRDI QIDQ2081678

Mahnamsadat Mirmokhalesooni, Hossein Momenaee Kermani

Publication date: 30 September 2022

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-021-00625-4

zbMATH Keywords

space-time codinglinear processingcomplex orthogonal designsmaximal rate

Mathematics Subject Classification ID

Other designs, configurations (05B30) Other types of codes (94B60)

Cites Work

• Unnamed Item
• A counterexample for the open problem on the minimal delays of orthogonal designs with maximal rates
• Orthogonal designs with maximal rates
• Upper bounds of rates of complex orthogonal space-time block codes
• The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes
• Space-time block codes from orthogonal designs
• The Final Case of the Decoding Delay Problem for Maximum Rate Complex Orthogonal Designs

This page was built for publication: On a conjecture about linear processing complex orthogonal designs