Natural orders for asymmetric space-time coding: minimizing the discriminant
From MaRDI portal
Publication:1623915
DOI10.1007/S00200-017-0348-5zbMATH Open1443.94039arXiv1701.00915OpenAlexW2582841402MaRDI QIDQ1623915FDOQ1623915
Authors: Amaro Barreal, Camilla Hollanti, Capi Corrales Rodrigáñez
Publication date: 15 November 2018
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Abstract: Algebraic space--time coding --- a powerful technique developed in the context of multiple-input multiple-output (MIMO) wireless communications --- has profited tremendously from tools from Class Field Theory and, more concretely, the theory of central simple algebras and their orders. During the last decade, the study of space--time codes for practical applications, and more recently for future generation (5G+) wireless systems, has provided a practical motivation for the consideration of many interesting mathematical problems. One such problem is the explicit computation of orders of central simple algebras with small discriminants. In this article, we consider the most interesting asymmetric MIMO channel setups and, for each treated case, we provide explicit pairs of fields and a corresponding non-norm element giving rise to a cyclic division algebra whose natural order has the minimum possible discriminant.
Full work available at URL: https://arxiv.org/abs/1701.00915
Recommendations
Cites Work
- Full-diversity, high-rate space-time block codes from division algebras
- Title not available (Why is that?)
- Construction Methods for Asymmetric and Multiblock Space–Time Codes
- The Computation of Sextic Fields with a Quadratic Subfield
- Integral bases for quartic fields with quadratic subfields
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- On the Densest MIMO Lattices From Cyclic Division Algebras
- The Golden Code: A<tex>$2,times,2$</tex>Full-Rate Space–Time Code With Nonvanishing Determinants
- Perfect Space–Time Block Codes
- Maximal Orders in the Design of Dense Space-Time Lattice Codes
- Fast-Decodable Asymmetric Space-Time Codes From Division Algebras
- The integers of a cyclic quartic field
- Perfect Space–Time Codes for Any Number of Antennas
- Computational class field theory
Cited In (1)
This page was built for publication: Natural orders for asymmetric space-time coding: minimizing the discriminant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623915)