Lecture Notes on 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 http://www.cambridge.org/9781107008731/. The previous (and obsolete) version of the lecture notes can be found at http://arxiv.org/abs/1001.3404v4/.

Cited by in corpus (62)

• A Tractable Approach to Coverage and Rate in Cellular Networks
• The information-theoretic costs of simulating quantum measurements
• Secure Multiterminal Source Coding with Side Information at the Eavesdropper
• Secret-key Agreement with Channel State Information at the Transmitter
• Bounds on the Capacity of the Relay Channel with Noncausal State at Source
• Probing Capacity
• Secure Lossy Source Coding with Side Information at the Decoders
• Conditions for a Monotonic Channel Capacity
• The Channel Capacity Increases with Power
• Gaussian Half-Duplex Relay Networks: improved constant gap and connections with the assignment problem
• On the Required Number of Antennas in a Point-to-Point Large-but-Finite MIMO System: Outage-Limited Scenario
• Noisy Network Coding
• Construction of Slepian-Wolf Source Code and Broadcast Channel Code Based on Hash Property
• Partial decode-forward for quantum relay channels
• On the Performance of the Relay-ARQ Networks
• On the Optimal Compressions in the Compress-and-Forward Relay Schemes
• Message and State Cooperation in a Relay Channel When Only the Relay Knows the State
• Capacity Region of Multiple Access Channel with States Known Noncausally at One Encoder and Only Strictly Causally at the Other Encoder
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• On Compress-Forward without Wyner-Ziv Binning for Relay Networks
• The K-User Interference Channel: Strong Interference Regime
• An Introduction to Quantum Bayesian Networks for Mixed States
• Optimal Real-time Spectrum Sharing between Cooperative Relay and Ad-hoc Networks
• Relay Channel with Orthogonal Components and Structured Interference Known at the Source
• On Real Time Coding with Limited Lookahead
• LQG Control Approach to Gaussian Broadcast Channels with Feedback
• Control-theoretic Approach to Communication with Feedback: Fundamental Limits and Code Design
• Message and state cooperation in multiple access channels
• Coordination via a relay
• Interference Networks with General Message Sets: A Random Coding Scheme
• State-Dependent Relay Channel with Private Messages with Partial Causal and Non-Causal Channel State Information
• Transmission Schemes for Four-Way Relaying in Wireless Cellular Systems
• Directed Information, Causal Estimation, and Communication in Continuous Time
• Subset Typicality Lemmas and Improved Achievable Regions in Multiterminal Source Coding
• Multiple Access Channel with Partial and Controlled Cribbing Encoders
• A unified graphical approach to random coding for multi-terminal networks
• The free space optical interference channel
• A Strictly Improved Achievable Region for Multiple Descriptions Using Combinatorial Message Sharing
• Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error
• The Two-Way Wiretap Channel: Achievable Regions and Experimental Results
• A New Sum-Rate Outer Bound for Interference Channels with Three Source-Destination Pairs
• An Achievable Rate Region for a Two-Relay Network with Receiver-Transmitter Feedback
• Compress-Forward without Wyner-Ziv Binning for the One-Way and Two-Way Relay Channels
• Wiretap Channels: Implications of the More Capable Condition and Cyclic Shift Symmetry
• On the Feedback Capacity of the Fully Connected $K$-User Interference Channel
• Linear Sum Capacity for Gaussian Multiple Access Channels with Feedback
• Opportunistic Relaying without CSI: Optimizing Variable-Rate HARQ
• Interference Channels with Rate-Limited Feedback
• A New Random Coding Technique that Generalizes Superposition Coding and Binning
• On the Capacity of the Discrete Memoryless Broadcast Channel with Feedback
• Two-User Gaussian Interference Channel with Finite Constellation Input and FDMA
• Superposition Noisy Network Coding
• Achievable Rates for a Two-Relay Network with Relays-Transmitter Feedbacks
• Capacity Region for Quantum Wiretap Coding
• Scalar Quantize-and-Forward for Symmetric Half-duplex Two-Way Relay Channels
• Half-Duplex Relaying for the Multiuser Channel
• Relaying for Multiuser Networks in the Absence of Codebook Information
• A Unified Relay Framework with both D-F and C-F Relay Nodes
• A New Capacity Result for the Z-Gaussian Cognitive Interference Channel
• Gelfand-Pinsker coding achieves the interference-free capacity
• Diversity Multiplexing Tradeoff of the Half-duplex Slow Fading Multiple Access Channel based on Generalized Quantize-and-Forward Scheme
• The Gaussian Interference Relay Channel: Improved Achievable Rates and Sum Rate Upperbounds Using a Potent Relay