On the Densest MIMO Lattices From Cyclic Division Algebras
From MaRDI portal
Publication:4975971
DOI10.1109/TIT.2009.2023713zbMATH Open1367.94220OpenAlexW2098217413WikidataQ110042034 ScholiaQ110042034MaRDI QIDQ4975971FDOQ4975971
Authors: Roope Vehkalahti, Jyrki Lahtonen, Kalle Ranto, Camilla Hollanti 
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2009.2023713
Cited In (14)
- Dense MIMO Matrix Lattices — A Meeting Point for Class Field Theory and Invariant Theory
- Normalized Minimum Determinant Calculation for Multi-block and Asymmetric Space-Time Codes
- On fast-decodable algebraic space-time codes
- Natural orders for asymmetric space-time coding: minimizing the discriminant
- Splitting full matrix algebras over algebraic number fields.
- Non-commutative ring learning with errors from cyclic algebras
- Algebraic lattice codes for linear fading channels
- Prime fuzzy ideals over noncommutative rings.
- Space-Time Codes from Crossed Product Algebras of Degree 4
- On the construction of perfect codes from \textit{HEX} signal constellations
- Lattices from maximal orders into quaternion algebras
- NTRU in Quaternion Algebras of Bounded Discriminant
- Algebraic construction of lattices via maximal quaternion orders
- Fractional non-norm elements for division algebras, and an application to cyclic learning with errors
This page was built for publication: On the Densest MIMO Lattices From Cyclic Division Algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975971)
