- [2011/03/30] Welcome to ee376b
Course DescriptionThis class is part 2 of information theory. For some reference, here is a rough description of the material that will be covered in this class. The course-content may change during the quarter.
- Maximum entropy and Burg's theorem.
- Gaussian Channel Capacity.
- Rate Distortion theory.
- Kolmogorov Complexity.
- Information theory and statistics.
- Stein's Lemma.
- Network Information theory.
- Slepian-Wolf Theorem.
- Optimal Investment and information theory.
- Universal Portfolios and data compression.
Building 540, Room 103, TTh 11-12:15pm, 3 Units
- Seven homework assignments.
- Final exam On Tuesday, June 7, 3:30p-6:30p, in Herrin T185. Also check out the Homework Policy.
Teaching StaffStaff Email:
ee376b-spr1011-staff (at) lists.stanford.edu
Note: Please use the Piazzza forums to post questions regarding the course. You are welcome to use personal emails in case of sensitive issues, but please be warned that the response time maybe larger.
- Administrative Associate:
- Denise Murphy
- Office: Packard 267
- Tel: 650-723-4731
- Fax: 650-724-6487
- Email: denise (at) ee (dot) stanford (dot) edu
- Teaching Assistant 1:
- Gowtham Kumar
- Office: Packard 251
- Tel: 650-799-1836
- Email: gowthamr (at) stanford (dot) edu
- Office hours: Mon 4-5 or by appointment
Elements of Information Theory by Cover and Thomas, 2nd Edition, New York: Wiley, 2006.You can also use the following auxiliary material:
- ``Information Theory and Reliable Communications,'' by Gallager, New York, Wiley 1968.
- ``Key Papers in Development of Information Theory,'' edited by Slepian, New York, IEEE Press, 1974.
- ``Information Theory,'' by Csiszar and Korner, New York, Academic Press, 1981.
- ``Claude Shannon, Collected Papers,'' edited by N.J.A. Sloane and Aaron D. Wyner, New York: IEEE Press, 1993.
In case you're using Internet Explorer and are not able to see the menu to the left, here are the links from the menu.