Multiple Access, Distributed Sources, and other Multiuser Problems (8 lectures):

• 1/31,2/05,2/06,2/07: The multiple access channel, Slepian-Wolf coding, duality:
  • Cover and Thomas, 14.3-5.
• 2/12: Student presentation on broadcast channels (Gokhan Mergen):
  • T. M. Cover: Broadcast Channels.
  • E. C. van der Meulen. A Survey of Multi-Way Channels in Information Theory: 1961-1976.
  • Cover and Thomas, 14.6.
• 2/14: Student presentation on multiple description source coding (Jay Chang):
  • L. H. Ozarow: On a Source-Coding Problem with Two Channels and Three Receivers.
  • A. A. El Gamal, T. M. Cover: Achievable Rates for Multiple Descriptions.
• 2/19: Source coding with side information:
  • Cover and Thomas, 14.8.
• 2/21: Network flows, the max-flow/min-cut theorem, and open research problems.
  • Cormen, Leiserson and Rivest: Introduction to Algorithms, Chapter 27.
  • Cover and Thomas, 14.10.

Code Constructions and Performance Analysis (6 lectures):

• 2/26: Quantization with side information:
  • S. Shamai, S. Verdu, R. Zamir: Systematic Lossy Source/Channel Coding.
  • R. Zamir, S. Shamai: Nested Linear/Lattice Codes for Wyner/Ziv Encoding.
  • S. D. Servetto: Quantization with Side Information: Lattice Codes, Asymptotics, and Applications in Wireless Networks.
• 2/28: Capacity and coding for timing packet channels:
  • S. D. Servetto, M. Vetterli: Phantom-Based Communication in Packet Channels.
• 3/05: Student presentation on multiple description quantization (Chao Tian):
  • V. A. Vaishampayan. Design of Multiple Description Scalar Quantizers.
• 3/06: Student presentation on network huffman codes (Wen Xu):
  • Q.Zhao, M.Effros. Optimal Code Design for Lossless and Near Lossless Source Coding in Multiple Access Networks.
• 3/07: Distributed parity computation:
  • R. G. Gallager. Finding Parity in a Simple Broadcast Network.
• 3/12-14: no class (I am away).
• 3/19-21: no class (winter break).
• 3/26: no class (I am away).
• 3/27: Open research problems.

Networking Problems with an Information Theoretic Flavor (9 lectures):

• 3/28: Small worlds graphs:
  • J. Kleinberg. The Small World Phenomenon: An Algorithmic Perspective.
• 4/02: Student presentation on the capacity of wireless networks (Uju Ndili):
  • P. Gupta, P. R. Kumar. The Capacity of Wireless Networks.
• 4/04: Student presentation on the timing capacity of queues (Xiaofei Wang):
  • V. Anantharam, S. Verdu. Bits Through Queues.
• 4/09,4/11: Multiaccess issues in networks:
  • Bertsekas and Gallager, Chapter 4 (Sections 4.2,4.3).
• 4/16-18: no class (I am away).
• 4/23,4/25: Controlled Queues:
  • R. Cristescu, S. D. Servetto. Queues under Feedback Control.
• 4/30: Invariant Measures for Markov Chains in Metric Spaces:
  • Meyn and Tweedie, selected topics from Chapters 4,5,8,10.
• 5/02: Final lecture, on open research problems.