We study the fundamental limits of communications over multi-layer wireless networks where each node has only limited knowledge of the channel state information. In particular, we consider the scenario in which each source-destination pair has only enough information to perform optimally when other pairs do not interfere. Beyond that, the only other information available at each node is the glo...

This is an exposition of two important theorems of information theory often singularly referred to as The Noisy-Channel Coding Theorem. Given a few assumptions about a channel and a source, the coding theorem demonstrates that information can be communicated over a noisy channel at a non-zero rate approximating the channel’s capacity with an arbitrarily small probability of error. It originally...

The dynamic capacity theorem characterizes the reliable communication rates of a quantum channel when combined with the noiseless resources of classical communication, quantum communication, and entanglement. In prior work, we proved the converse part of this theorem by making contact with many previous results in the quantum Shannon theory literature. In this work, we prove the theorem with an...

In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbitrarily close to channel capacity and probabilities of error arbitrarily close to zero. Fifty years later, codes for the Gaussian channel have been discovered that come close to these fundamental limits. There is now a sub...

In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbitrarily close to channel capacity and probabilities of error arbitrarily close to zero. Fifty years later, codes for the Gaussian channel have been discovered that come close to these fundamental limits. There is now a sub...

The most fundamental results of information theory are Shannon’s theorems. These theorems express the bounds for reliable data compression and transmission over a noisy channel. Their proofs are non-trivial but rarely detailed, even in the introductory literature. This lack of formal foundations makes it all the more unfortunate that crucial results in computer security rely solely on informati...

In classical information theory it is well-known that feedback does not improve the channel capacity. We demonstrate that this is not the case in the interactive setting by developing a new coding scheme for interactive communication over the binary symmetric channel (BSC) with feedback that allows recovery of the original communication with vanishing probability of error. More precisely, we sh...