2010/01/13 by N. Lakshmi Prasad, Prasad, N. Lakshmi, B. Sundar Rajan +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1001.2076
15 pages, 1 table
arxiv created 2010/01/13 · openalex publication_date 2010/01/13 · arxiv updated 2010/01/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we construct low decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condition is shown to be easily checked by transferring the problem to \mathbbF4 domain. The problem of constructing low decoding complexity STBCs is shown to be equivalent to finding certain codes over \mathbbF4. It is shown that almost all known low complexity STBCs can be obtained by this approach. New codes are given that have the least known decoding complexity in particular ranges of rate.