Construction of New Delay-Tolerant Space-Time Codes
From MaRDI portal
Publication:5273613
DOI10.1109/TIT.2011.2137230zbMATH Open1365.94576arXiv1011.0474MaRDI QIDQ5273613FDOQ5273613
Authors: Mireille Sarkiss, Ghaya Rekaya-Ben Othman, Mohamed Oussama Damen, Jean-Claude Belfiore 
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Perfect Space-Time Codes (STC) are optimal codes in their original construction for Multiple Input Multiple Output (MIMO) systems. Based on Cyclic Division Algebras (CDA), they are full-rate, full-diversity codes, have Non-Vanishing Determinants (NVD) and hence achieve Diversity-Multiplexing Tradeoff (DMT). In addition, these codes have led to optimal distributed space-time codes when applied in cooperative networks under the assumption of perfect synchronization between relays. However, they loose their diversity when delays are introduced and thus are not delay-tolerant. In this paper, using the cyclic division algebras of perfect codes, we construct new codes that maintain the same properties as perfect codes in the synchronous case. Moreover, these codes preserve their full-diversity in asynchronous transmission.
Full work available at URL: https://arxiv.org/abs/1011.0474
Matrices over special rings (quaternions, finite fields, etc.) (15B33) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial codes (94B25)
This page was built for publication: Construction of New Delay-Tolerant Space-Time Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273613)
