Random algebraic lattices and codes for wireless communications

DOI10.1007/978-3-030-61303-7_4zbMath1484.11154OpenAlexW3118402247MaRDI QIDQ2658391

Cong Ling, Antonio Campello

Publication date: 22 March 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-61303-7_4

zbMATH Keywords

information-theoretic securityfading channelsmultiple-input-multiple-output channels

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Relations with coding theory (11H71)

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Improved sphere packing lower bounds from Hurwitz lattices
• Probabilistic encryption
• A lower bound on packing density
• The minimum values of positive quadratic forms in six, seven and eight variables
• An introduction to the geometry of numbers.
• A mean value theorem in geometry of numbers
• Semantic Security for the Wiretap Channel
• The Secrecy Capacity of Compound Gaussian MIMO Wiretap Channels
• Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap
• Achieving AWGN Channel Capacity With Lattice Gaussian Coding
• Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
• Lattice Coding for Signals and Networks
• On coding without restrictions for the AWGN channel
• Averaging bounds for lattices and linear codes
• Almost Universal Codes for MIMO Wiretap Channels
• Random Ensembles of Lattices From Generalized Reductions
• A Note on Sphere Packings in High Dimension
• Convex and Discrete Geometry
• Fundamentals of Wireless Communication
• Almost universal codes achieving ergodic MIMO capacity within a constant gap
• On the geometry of numbers