References & Further Reading

References

V. R. Cadambe and S. A. Jafar, Interference Alignment and Degrees of Freedom of the K-User Interference Channel, 2008
The original paper proving $K/2$ total DoF for the $K$-user Gaussian interference channel. The algebraic precursor of all finite-field IA constructions used in this book.
S. A. Jafar, Interference Alignment — A New Look at Signal Dimensions in a Communication Network, 2011
Monograph-length survey including the finite-field formulation of IA used in this chapter. The cleanest reference for the achievability and converse arguments in Section 4.1.
K. Lee, C. Suh, and K. Ramchandran, High-Dimensional Coded Matrix Multiplication, 2017
Connects coded matrix multiplication to finite-field interference alignment. Precursor to the polynomial-code construction (Yu et al. 2017) and the main reference for Section 4.2's IA-based recovery threshold.
Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, Polynomial Codes: An Optimal Design for High-Dimensional Coded Matrix Multiplication, 2017. [Link]
The optimal construction for coded matrix multiplication. Achieves the IA recovery threshold of Section 4.2 deterministically and explicitly — the subject of Chapter 5.
M. A. Maddah-Ali and U. Niesen, Fundamental Limits of Caching, 2014
Introduces the coded-caching framework and proves the global gain $1 + KM/F$. The underlying achievability construction uses finite-field IA in the delivery phase.
H. Sun and S. A. Jafar, The Capacity of Private Information Retrieval, 2017
The Sun-Jafar PIR capacity formula and its achievability via finite-field IA. Chapter 13 of this book develops the result in full; Section 4.4 previews it.
O. El Ayach, S. W. Peters, and R. W. Heath Jr., The Practical Challenges of Interference Alignment, 2013
Sober assessment of why IA has not translated into wireless deployments. Useful as a counterpoint: the wireless challenges of IA are *not* the challenges of distributed-computing IA, which works over exact algebra.
A. Beimel, Secret-Sharing Schemes: A Survey, 2011
Survey including a section on PIR schemes and their connections to secret-sharing. Useful for understanding the pre-capacity-result era of PIR.
S. El Rouayheb and K. Ramchandran, Coded Caching: Theory and Practice, 2018
Survey of coded-caching theory with an eye toward deployability in real CDNs. Engineering context for the §4.3 discussion.
K. Wan, D. Tuninetti, and G. Caire, Fundamental Limits of Caching for Demand Privacy Against Colluding Users, 2021
CommIT-group extension of coded caching to demand privacy. Tagged as the primary commit_contribution in Chapter 7 of this book; cross-referenced here because the construction builds on the Section 4.3 IA delivery primitive.
R. Cramer, I. B. Damgård, and J. B. Nielsen, Secure Multiparty Computation and Secret Sharing, Cambridge University Press, 2015
Ch. 6 relates multi-party computation protocols to network-coding / IA primitives. Useful background for the algebraic flavor of this chapter.