2010/11/01 by Mireille Sarkiss, Ghaya Rekaya-Ben Othman, Sarkiss, Mireille +6
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Technologies #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1011.0474
33 pages, 7 figures
arxiv created 2010/11/01 · openalex publication_date 2010/11/01 · arxiv updated 2010/11/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.