| No. | Date | Subject Matter | Who? | Recommended Reading and Practice Problems |
|---|---|---|---|---|
| FIRST PASS | ||||
| 1 | Aug 31 | Course Overview Network Flow Problems |
Ford and Fulkerson | |
| 2 | Sep 2 | Network Source Coding Slepian-Wolf | Cover and Thomas, Section 14.4 | |
| 3 | Sep 7 | continued Multiple Access Channel Examples |
||
| 4 | Sep 9 | Multiple Access Channel Achievability via typical sequences | ||
| 5 | Sep 14 | Multiple Access Channel Achievability via Gallager Exponent | Gallager Chapter 5; Derivative of Gallager exponent | |
| 6 | Sep 16 | Multiple Access Channel Converse Broadcast Channel Example; superposition coding; definitions. |
Cover, IT 1972. Cover and Thomas, Section 14.6. | |
| 7 | Sep 21 | Broadcast Channel Introduction to General Networks; Separation Theorem |
Cover and Thomas, Chapter 14. | |
| 8 | Sep 23 | Feedback: Part I | Capacity does not increase for memoryless channels. Neither does it improve the block-coding reliability function for the binary erasure channel in the high rate regime. | |
| 9 | Oct 5 | Feedback: Part II | Without feedback, the sphere-packing bound is still
valid with respect to delay rather than block length: M. S. Pinsker, Bounds of the
Probability and of the Number of Correctable Errors for Nonblock
Codes, Problemy Peredachi Informatsii, Volume 3, Number 4, October
- December, 1967 This bound can be beaten if feedback is available, even in the high rate regime. |
|
| 10 | Oct 7 | Feedback: Part III | ||
| SECOND PASS | ||||
| 11 | Oct 12 | Side Information I: source coding, rate-distortion (Wyner-Ziv) | Dan Hazen |
Cover and Thomas, Sections 14.8 and 14.9. A. D. Wyner and J. Ziv, The rate-distortion function for source coding with side information at the decoder, IEEE Trans Info Theory, 1976. A. D. Wyner, The rate-distortion function for source coding with side information at the decoder-{II}: General sources, Information and Control, vol. 38, pp. 60--80, 1978. Study Problem |
| 12 | Oct 14 | Multi-terminal source coding | Krishnan Eswaran | T. Berger, Multiterminal Source Coding. Lectures presented at CISM Summer School on the Information Theory Approach to Communications, 1977. K. B. Housewright, Source Coding Studies For Multiterminal Systems. Ph.D. Thesis, UCLA, 1977. Study Problem |
| 13 | Oct 19 | Multiple-access with correlated sources | Anand Sarwate | D. Slepian and J. K. Wolf. A Coding Theorem for Multiple Access Channels With Correlated Sources. Bell Syst Tech Journal, September 1973. T. M. Cover, A. A. El Gamal, and M. Salehi. Multiple access channels with arbitrarily correlated sources, IEEE Trans Info Theory, 1980. Study Problem |
| 14 | Oct 21 | Multiple-access with feedback | Salman Avestimehr and Paolo Minero | N. T. Gaarder and J. K. Wolf. The capacity region of a multiple-access discrete memoryless channel can increase with feedback, IEEE Trans Info Theory, 1975. L. Ozarow. The capacity of the white Gaussian multiple access channel with feedback, IEEE Trans Info Theory, 1984. Study Problem |
| 15 | Oct 26 | Side Information II: channel coding (Gel'fand-Pinsker, Costa) | Dr. Stark Draper | |
| 16 | Oct 28 | Multiple-description coding | Dr. Rohit Puri | |
| 17 | Nov 2 | Relay Networks |
T. M. Cover and A. A. El Gamal. Capacity theorems for the relay channel. IEEE Trans Info Theory, 1979. Kramer, Gastpar, Gupta. Cooperative strategies and capacity theorems for relay networks. Subm to IEEE Trans Info Theory. |
|
| 18 | Nov 4 | Interference Networks, Two-way channel | C. E. Shannon. Two-way communication channels. Proc. 4th Berkeley Symp. Prob. Stat., June 20 - July 30, 1960. Reprinted in "Key Papers in the Development of Information Theory," IEEE Press, NY, 1974. | |
| 19 | Nov 9 | Broadcast | Lenny Grokop | K. Marton. A coding theorem for the discrete memoryless broadcast channel. IEEE Trans Info Theory, 1979. "Dirty Paper" coding. Study Problem |
| Nov 11 | Veterans Day (no class) | |||
| 20 | Friday, Nov 12, 9:30-11, 299 Cory | Reliability at low rates | Aaron Wagner | Gallager (Section 5.7 and pp. 167-169) Csiszár/Korner (Exercise 2.5.33) K. Sh. Zigangirov. Upper Bounds for the Error Probability for Channels with Feedback. PROBLEMS OF INFORMATION TRANSMISSION, Volume 6, Number 2, April-June, 1970, pp. 159-163. R. G. Gallager. The random coding bound is tight for the average code. IEEE Trans Info Theory, 1973. Study Problem |
| 21 | Nov 16 | Capacity of large networks | Bobak Nazer |
P. Gupta and P. R. Kumar,
The capacity of wireless networks. IEEE Trans Info Theory, March 2000.
L-L Xie and P. R. Kumar, A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation. IEEE Trans Info Theory, May 2004. O. Lévêque, E. Telatar, Information theoretic upper bounds on the capacity of large extended ad hoc wireless networks, IEEE Trans Info Theory, to appear. |
| 22 | Nov 18 | 1. "Sensor Networks": Networks of sources and channels
2. Network Coding |
Alex Dimakis |
T. Ho, R. Koetter, M. Medard, M. Effros, J. Shi, and D. Karger, Toward a random operation of networks. Subm to IEEE Trans Info Theory. |
| 23 | Nov 23 | Interactive Computation and Control | Niels Hoven and Jingyi Shao | L. Schulman, Coding for interactive communication IT Transactions, November 1994. A. Sahai The necessity and sufficiency of anytime capacity for scalar control over a noisy communication link to appear at the 2004 Conference on Decision and Control. |
| 24 | Wednesday Nov 24 | Interactive Computation, Anytime reliability through tree codes, decision feedback |
Rahul Tandra |
A. Sahai Source coding and channel requirements for unstable processes Preprint.
D. Forney Exponential error bounds for erasure, list, and decision feedback schemes, IT Transactions, March 1968 |
| 25 | Nov 30 | Anytime code for wideband
channel, Sufficient conditions for control over noisy channels (part I), Burnashev bound on variable length codes |
Cheng Chang | A. Sahai, Anytime coding on the infinite bandwidth AWGN channel: A sequential semi-orthogonal code, preprint A. Sahai, S. Mitter, The necessity and sufficiency of anytime capacity for control over a noisy communication link: Parts I and II, preprint M. V. Burnashev. Data transmission over a discrete channel with feedback, random transmission time. Problemy Perdachi Informatsii, 12(4):10-30, October-December 1976. |
| 26 | Wednesday Dec 1 | Variable length code construction with
feedback Noisy feedback (part I) |
H. Yamamoto and K. Itoh, Asymptotic
performance of a modified Schalkwijk-Barron scheme for channels with
noiseless feedback, IT Transactions, November 1979 J.M. Ooi and G.W. Wornell, Fast Iterative Coding Techniques for Feedback Channels, IT Transactions, November 1998 A. Sahai and T. Simsek, On the variable-delay reliability function of discrete memoryless channels with access to noisy feedback, Information Theory Workshop October 2004. |
|
| 27 | Dec 2 | Noisy feedback as interaction (application of anytime codes) in variable length coding,
Feedback capacity and directed information Gaussian feedback capacity (AEP for arbitrary Gaussian vectors) |
Paul Liu |
S. Tatikonda,
Control Under Communication Constraints, PhD Thesis Chapter 4, MIT
2000 T. M. Cover and S. Pombra, Gaussian feedback capacity, IT Transactions, January 1989 Study Problem |
| 28 | Dec 7 | Sufficient conditions for control continued,
Vector-control and the need for discrimination in interactive settings |
A. Sahai and S. Mitter, A fundamental need for differentiated `Quality of Service' over communication links: an information theoretic approach, Allerton Conference on Communication, Control, and Computing, October 2000. | |
| 29 | Dec 9 | ***Project Presentation Day? |