Fast-Decodable MIDO Codes With Large Coding Gain

DOI10.1109/TIT.2013.2292513zbMath1364.94728arXiv1208.1593MaRDI QIDQ5346110

Balaji Sundar Rajan, Koteshwar Pavan Srinath

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/1208.1593

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (7)

How to obtain lattices from \((f,\sigma,\delta)\)-codes via a generalization of construction A ⋮ On fast-decodable algebraic space-time codes ⋮ The nonassociative algebras used to build fast-decodable space-time block codes ⋮ Tensor products of nonassociative cyclic algebras ⋮ How to obtain division algebras used for fast-decodable space-time block codes ⋮ Nonassociative cyclic extensions of fields and central simple algebras ⋮ Quotients of orders in algebras obtained from skew polynomials with applications to coding theory

This page was built for publication: Fast-Decodable MIDO Codes With Large Coding Gain