Algebraic lattice codes for linear fading channels
From MaRDI portal
Publication:2658392
DOI10.1007/978-3-030-61303-7_5zbMath1478.94147arXiv1712.07182OpenAlexW2779160310MaRDI QIDQ2658392
Publication date: 22 March 2021
Full work available at URL: https://arxiv.org/abs/1712.07182
Other types of codes (94B60) Lattice packing and covering (number-theoretic aspects) (11H31) Channel models (including quantum) in information and communication theory (94A40) Relations with coding theory (11H71)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructive high-dimensional sphere packings
- Ideale kleiner Norm in Idealklassen und eine Regulatorabschätzung
- Tours de corps de classes et estimations de discriminants
- Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap
- Some optimal codes have structure
- Algebraic lattice constellations: bounds on performance
- Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
- Diagonal Lattice Space–Time Codes From Number Fields and Asymptotic Bounds
- EUCLIDEAN MINIMA AND CENTRAL DIVISION ALGEBRAS
- Space-time codes for high data rate wireless communication: performance criterion and code construction
- Universal Lattice Codes for MIMO Channels
- Good lattice constellations for both Rayleigh fading and Gaussian channels
- On the Densest MIMO Lattices From Cyclic Division Algebras
- Almost universal codes achieving ergodic MIMO capacity within a constant gap
- Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions : a survey of recent results
This page was built for publication: Algebraic lattice codes for linear fading channels
