Iterated Space-Time Code Constructions From Cyclic Algebras

DOI10.1109/TIT.2013.2266397MaRDI QIDQ5346404zbMATH OpenOpenAlexFDO

Authors Nadya Markin, Frédérique Oggier

Publication date 8 June 2017

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

Full work available at URL https://arxiv.org/abs/1205.5134

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29) Other types of codes (94B60)

Abstract: We propose a full-rate iterated space-time code construction, to design 2n-dimensional codes from n-dimensional cyclic algebra based codes. We give a condition to determine whether the resulting codes satisfy the full-diversity property, and study their maximum likelihood decoding complexity with respect to sphere decoding. Particular emphasis is given to the cases n = 2, sometimes referred to as MIDO (multiple input double output) codes, and n = 3. In the process, we derive an interesting way of obtaining division algebras, and study their center and maximal subfield.

Recommendations

• Cyclic division algebras: a tool for space--time coding
• Cyclic Algebras for Noncoherent Differential Space–Time Coding
• Cyclic division algebras in space-time coding: a brief overview
• Algebraic Cayley Differential Space–Time Codes
• Space-Time Codes from Crossed Product Algebras of Degree 4
• Space–Time Codes From Structured Lattices
• Iterative decoding of wrapped space-time codes
• Algebraic space-time codes based on division algebras with a unitary involution
• On fast-decodable algebraic space-time codes
• On optimal multilayer cyclotomic space-time code designs

Cited in

(12)

• How to obtain lattices from (f,,)-codes via a generalization of construction A
• Nonassociative cyclic extensions of fields and central simple algebras
• On fast-decodable algebraic space-time codes
• Constructions of fast-decodable distributed space-time codes
• Information-Lossless Space–Time Block Codes From Crossed-Product Algebras
• Quotients of orders in algebras obtained from skew polynomials with applications to coding theory
• How to obtain division algebras used for fast-decodable space-time block codes
• Space-Time Codes from Crossed Product Algebras of Degree 4
• Nonassociative cyclic algebras and the semiassociative Brauer monoid
• Using cyclic \((f,\sigma )\)-codes over finite chain rings to construct \(\mathbb{Z}_p\)- and \(\mathbb{F}_q[\![t]\!]\)-lattices
• The nonassociative algebras used to build fast-decodable space-time block codes
• Tensor products of nonassociative cyclic algebras

This page was built for publication: Iterated Space-Time Code Constructions From Cyclic Algebras

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