Fast-decodable MIDO codes from non-associative algebras

DOI10.1504/IJICOT.2015.068695zbMATH Open1338.94109OpenAlexW2065359399MaRDI QIDQ906899FDOQ906899

Authors: Susanne Pumplün, Andrew Steele 

Publication date: 29 January 2016

Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijicot.2015.068695

Recommendations

• 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

zbMATH Keywords

fast-decodableiterated space-time code constructionsMIDO codesnon-associative division algebrasrate \(n\)

Mathematics Subject Classification ID

Nonassociative division algebras (17A35) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (9)

• The automorphisms of Petit's algebras
• Nonassociative cyclic extensions of fields and central simple algebras
• How to obtain lattices from \((f,\sigma,\delta)\)-codes via a generalization of construction A
• Tensor products of nonassociative cyclic algebras
• Nonassociative differential extensions of characteristic \(p\)
• The nonassociative algebras used to build fast-decodable space-time block codes
• Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes
• Nonassociative cyclic algebras and the semiassociative Brauer monoid
• Quotients of orders in algebras obtained from skew polynomials with applications to coding theory

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)