Lecture Notes on Network Information Theory

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 this http URL The previous (and obsolete) version of the lecture notes can be found at this http URL

[1]  Stephen P. Boyd,et al.  Determinant Maximization with Linear Matrix Inequality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[2]  R. Ahlswede.  Elimination of correlation in random codes for arbitrarily varying channels , 1978 .

[3]  Shlomo Shamai,et al.  On the capacity of some channels with channel state information , 1999, IEEE Trans. Inf. Theory.

[4]  Yossef Steinberg,et al.  The multiple-access channel with partial state information at the encoders , 2005, IEEE Transactions on Information Theory.

[5]  Emre Telatar,et al.  Bounds on the capacity region of a class of interference channels , 2007, 2007 IEEE International Symposium on Information Theory.

[6]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[7]  R. Ahlswede.  The Capacity Region of a Channel with Two Senders and Two Receivers , 1974 .

[8]  Robert B. Ash,et al.  Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[9]  Andrea J. Goldsmith,et al.  Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity , 2001, IEEE Trans. Inf. Theory.

[10]  B.S. Choi,et al.  An information-theoretic proof of Burg's maximum entropy spectrum , 1984, Proceedings of the IEEE.

[11]  Raymond Knopp,et al.  Information capacity and power control in single-cell multiuser communications , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[12]  Patrick P. Bergmans,et al.  A simple converse for broadcast channels with additive white Gaussian noise (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[13]  Shlomo Shamai,et al.  A broadcast strategy for the Gaussian slowly fading channel , 1997, Proceedings of IEEE International Symposium on Information Theory.

[14]  Max H. M. Costa,et al.  The capacity region of the discrete memoryless interference channel with strong interference , 1987, IEEE Trans. Inf. Theory.

[15]  Amin Gohari,et al.  Evaluation of Marton's inner bound for the general broadcast channel , 2009, ISIT.

[16]  Thomas M. Cover,et al.  Broadcast channels , 1972, IEEE Trans. Inf. Theory.

[17]  I. Olkin,et al.  A Convexity Proof of Hadamard's Inequality , 1982 .

[18]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[19]  Varun Jog,et al.  An information inequality for the BSSC channel , 2009 .

[20]  Te Sun Han,et al.  A new achievable rate region for the interference channel , 1981, IEEE Trans. Inf. Theory.

[21]  Massimo Franceschetti,et al.  Random Access: An Information-Theoretic Perspective , 2012, IEEE Transactions on Information Theory.

[22]  Rudolf Ahlswede,et al.  Source coding with side information and a converse for degraded broadcast channels , 1975, IEEE Trans. Inf. Theory.

[23]  Jacob Wolfowitz,et al.  Multiple Access Channels , 1978 .

[24]  John M. Cioffi,et al.  Multiple-Access Channels with Distributed Channel State Information , 2007, 2007 IEEE International Symposium on Information Theory.

[25]  Syed Ali Jafar,et al.  Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel , 2008, IEEE Transactions on Information Theory.

[26]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

[27]  Young-Han Kim,et al.  Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[28]  Chris Douglas Heegard.  Capacity and coding for computer memory with defects , 1981 .

[29]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[30]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

[31]  J. P. Burg,et al.  Maximum entropy spectral analysis. , 1967 .