Network Information Theory

Abstract

These lecture notes have been converted to a book titled Network Information Theory published recently by Cambridge University Press. This book provides a significantly expanded exposition of the material in the lecture notes as well as problems and bibliographic notes at the end of each chapter. The authors are currently preparing a set of slides based on the book that will be posted in the second half of 2012.More information about the book can be found at

Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks

“…. , X M ) to be jointly Gaussian (and/or symmetric) is not necessarily optimal for (13) and (14), but it gives a lower bound on the capacity.…”

“…, w M ). This event has a vanishing error probability as n → ∞ ( [13], Lemma 8.2) if we have (13); • (12) does not hold for the original indices (w 1 , w 1 , . .…”

“…The cardinality of Q is bounded using the Fenchel-Eggleston-Carathéodory theorem ( [13], Appendix A) (see also ([24], Appendix B)).…”

On the Gaussian interference channel with unilateral generalized feedback

“…Achievable rates and capacity region are defined as usual [9]. The G-IC-UGF has input/output relationship…”

“…The single rate bounds in (1a)-(1c) are cut-set bounds [9]. The sum-rate bounds in (1d)-(1e) are from [2], and that in (1f) is from [1].…”