ECE255C: Network Information Theory



Basic probability. ECE255A recommended but not required. Those who have not taken ECE255A/ECE255B, however, ought to fill in the pre-authorization form.

Course description

Network information theory studies the fundamental limits on information flow in networks and optimal coding techniques and protocols that achieve these limits. It extends Shannon's point-to-point information theory and the Ford–Fulkerson max-flow min-cut theorem to networks with multiple sources and destinations, broadcasting, interference, relaying, distributed compression, and computing. Although a complete theory is yet to be developed, several beautiful results and techniques have been developed over the past forty years with applications in wireless communication, the Internet, and other networked systems.

This course aims to provide a broad coverage of key results, techniques, and open problems in network information theory. Topics include background (information measures and typical sequences, point-to-point communication), single-hop networks (multiple access channels, broadcast channels, interference channels, channels with state, Gaussian vector channels, distributed compression, multiple description coding, and joint source–channel coding), and multihop networks (graphical networks, relay networks, and interactive channel coding).

Course requirements and grading


TR 3:30-4:50 pm, Mandeville Center B-146.

Teaching staff