References & Further Reading

References

U. Erez and R. Zamir, Achieving $\tfrac{1}{2} \log(1 + \mathrm{SNR})$ on the AWGN channel with lattice encoding and decoding, 2004
The landmark paper establishing that nested lattice codes with MMSE scaling and dithering achieve the AWGN capacity exactly. The central reference of this chapter; s02 follows the proof structure of Theorem 1 of this paper.
M. H. M. Costa, Writing on dirty paper, 1983
Costa's original proof (5 pages) that a Gaussian channel with non-causally known interference at the transmitter achieves the clean-channel capacity. The $\\alpha = \\ntn{snr}/(1 + \\ntn{snr})$ MMSE coefficient that appears in Erez–Zamir was first derived here. Foundation of s04.
U. Erez, S. Shamai, and R. Zamir, Capacity and lattice strategies for canceling known interference, 2005
The lattice implementation of Costa's dirty-paper coding — showing that a single extra mod-$\\Lambda_s$ at the transmitter suffices to achieve the clean-channel capacity on the dirty- paper channel. Backbone of s04.
E. Viterbo and J. Boutros, A universal lattice code decoder for fading channels, 1999
The re-discovery and popularisation of the sphere decoder for communications. Empirical $O(n^3)$ average complexity at high SNR. Foundation of s05.
R. Zamir, Lattice Coding for Signals and Networks, Cambridge University Press, 2014
The modern graduate-level reference for lattice coding with a network-information-theoretic emphasis. Chapters 7–8 cover the content of s01–s04 of this chapter; Chapter 5 covers lattice decoding (s05). Used throughout as a backup reference.
G. D. Forney Jr., Coset codes — part I: introduction and geometrical classification, 1988
Forney's foundational paper on the coset-code framework. Part I establishes the partition-chain view of lattice-based coded modulation, with shaping gain and coding gain as independent factors. Cited in s01 (historical context) and s03 (shaping-gain definition).
G. D. Forney Jr., Coset codes — part II: binary lattices and related codes, 1988
Companion to Part I. Catalogs binary lattices $\\mathbb{Z}^n$, $D_n$, $E_8$, and the Leech lattice as Forney's coset-coded-modulation constructions. Cited in s01.
G. D. Forney Jr. and G. Ungerboeck, Modulation and coding for linear Gaussian channels, 1998
Sweeping survey that named and quantified shaping gain and coding gain as independent factors. The $1.53$ dB asymptotic ceiling on shaping gain was stated here with full clarity. Pre-Erez-Zamir but sets up the additive-decomposition intuition of s02–s03.
H.-A. Loeliger, Averaging bounds for lattices and linear codes, 1997
Connects the Minkowski–Hlawka random-lattice averaging to Shannon's random-coding arguments. Provides the existence theorem for Poltyrev-good $\\Lambda_c$ used in Step 4 of the Erez–Zamir proof (s02).
J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, Springer, 3rd ed., 1999
Encyclopaedic reference for lattice theory. Chapter 2 is the standard reference for normalised second moments and shaping gain; Chapter 20 is the reference for lattice decoding algorithms. Used throughout s01, s03, s05.
M. Pohst, On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications, 1981
Original lattice enumeration algorithm from algebraic number theory — the mathematical ancestor of the sphere decoder. Uses QR decomposition and layer-by-layer search.
C. P. Schnorr and M. Euchner, Lattice basis reduction: improved practical algorithms and solving subset sum problems, 1994
The zigzag enumeration order that made the sphere decoder practical. Schnorr and Euchner's motivation was cryptographic (attacking subset-sum based cryptosystems); Viterbo-Boutros transferred the idea to communications five years later.
M. O. Damen, H. El Gamal, and G. Caire, On maximum-likelihood detection and the search for the closest lattice point, 2003
CommIT-group paper that rigorously analysed the sphere decoder's average complexity and provided the computational certificate enabling the LAST codes of Ch. 17. Forward reference to Ch. 17 of this book.
M. Tomlinson, New automatic equalizer employing modulo arithmetic, 1971
Original paper on Tomlinson's precoder for known ISI channels. Independently proposed by Harashima-Miyakawa the following year. The scalar ancestor of lattice DPC.
H. Harashima and H. Miyakawa, Matched-transmission technique for channels with intersymbol interference, 1972
Independent discovery of the Tomlinson precoder in Japan. The THP acronym (Tomlinson–Harashima precoding) honours both contributions.
H. El Gamal, G. Caire, and M. O. Damen, Lattice coding and decoding achieve the optimal diversity–multiplexing tradeoff of MIMO channels, 2004
The CommIT group's foundational paper on Lattice Space-Time (LAST) codes — nested-lattice constructions that achieve the optimal MIMO DMT. Central forward reference to Ch. 17 of this book.
C. E. Shannon, A mathematical theory of communication, 1948
Shannon's original paper establishing AWGN capacity via random Gaussian codebook. The Erez–Zamir theorem of this chapter is the structured-codebook counterpart, proving that lattice codes match Shannon's bound with algebraic structure.
G. Poltyrev, On coding without restrictions for the AWGN channel, 1994
Introduced the Poltyrev capacity: the supremum of rates for which lattice decoding achieves vanishing error probability on the infinite-constellation AWGN channel. The $1.53$ dB gap between Poltyrev and Shannon capacities is the shaping-gain gap of s03.
C. A. Rogers, Lattice coverings of space, 1959
Rogers's original existence proof that random lattices achieve the $1/(2\\pi e)$ normalised second moment bound asymptotically. Used in Step 3 of the Erez–Zamir proof (s02) and in Theorem 15.3 of s03.
P. L. Zador, Asymptotic quantization error of continuous signals and the quantization dimension, 1963
Original derivation of the Zador lower bound $G(\\Lambda) \\ge 1/(2\\pi e)$ on normalised second moments, via quantisation-theoretic arguments. The bound that $E_8$ gets $43\\%$ of the way toward.
B. M. Hochwald, C. B. Peel, and A. L. Swindlehurst, A vector-perturbation technique for near-capacity multiantenna multiuser communication—part II: perturbation, 2005
Practical vector perturbation precoding for MU-MIMO, a lattice-DPC implementation. Uses sphere decoder at the base station to find the optimal lattice perturbation. Engineering note in s04.
H. Weingarten, Y. Steinberg, and S. Shamai (Shitz), The capacity region of the Gaussian multiple-input multiple-output broadcast channel, 2006
Proved that sequential DPC achieves the full sum-capacity of the MIMO Gaussian broadcast channel — the theoretical backbone of modern MU-MIMO. Cited in the wireless connection of s04.
M. Ajtai, The shortest vector problem in $L_2$ is NP-hard for randomized reductions, 1998
Ajtai's proof of NP-hardness of the shortest-lattice-vector problem under randomised reductions. Established the worst-case hardness cited in s05 Definition.
D. Micciancio, The shortest vector in a lattice is hard to approximate to within some constant, 2001
Strengthened Ajtai's hardness result: SVP is NP-hard even to approximate within a constant factor. Justifies why worst-case sphere decoding is exponential, but average-case remains polynomial at high SNR.
A. K. Lenstra, H. W. Lenstra Jr., and L. Lovász, Factoring polynomials with rational coefficients, 1982
The LLL lattice reduction algorithm that restores well-conditioned bases for poorly-conditioned lattices. Standard pre-processing before sphere decoding in s05.
R. Urbanke and B. Rimoldi, Lattice codes can achieve capacity on the AWGN channel, 1998
Pre-Erez–Zamir attempt to achieve AWGN capacity with lattice codes. Achieved $\\tfrac12 \\log_2(\\ntn{snr}/(2\\pi e/12))$, 1.53 dB short of Shannon — the gap that Erez–Zamir closed 6 years later via the MMSE scalar.