Fast-decodable MIDO codes from non-associative algebras
Summary: By defining a multiplication on a direct sum of \(n\) copies of a given cyclic division algebra, we obtain new unital non-associative algebras. We employ their left multiplication to construct rate-\(n\) and rate-2 fully diverse fast ML-decodable space-time block codes for a Multiple-Input-Double-Output (MIDO) system. We give examples of fully diverse rate-2 \(4 \times 2\), \(6 \times 2\), \(8 \times 2\) and \(12 \times 2\) space-time block codes and of a rate-3 \(6 \times 2\) code. All are fast ML-decodable. Our approach generalises the iterated codes in [\textit{N. Markin} and \textit{F. Oggier}, IEEE Trans. Inf. Theory 59, No. 9, 5966--5979 (2013; Zbl 1364.94763)].
- The nonassociative algebras used to build fast-decodable space-time block codes
- Space-time block codes from nonassociative division algebras
- Cyclic division algebras: a tool for space--time coding
- How to obtain division algebras used for fast-decodable space-time block codes
- Full-diversity, high-rate space-time block codes from division algebras
- How to obtain lattices from (f,,)-codes via a generalization of construction A
- Nonassociative cyclic extensions of fields and central simple algebras
- Nonassociative differential extensions of characteristic p
- Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes
- The automorphisms of Petit's algebras
- Quotients of orders in algebras obtained from skew polynomials with applications to coding theory
- Nonassociative cyclic algebras and the semiassociative Brauer monoid
- A parametrization of nonassociative cyclic algebras of prime degree
- The nonassociative algebras used to build fast-decodable space-time block codes
- Tensor products of nonassociative cyclic algebras
This page was built for publication: Fast-decodable MIDO codes from non-associative algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906899)