EE 553
Introduction to Information Theory
Schedule
Fall 2003

Tentative Schedule

• Chapter 1 and preview, Lecture 1
• Chapter 2: 3 lectures
• Chapter 3: 1 lecture
• Chapter 4: 1 lecture
• Chapter 5: 2 lectures
• Chapter 6: 1 lecture
• Chapter 8: 3 lectures
• Chapter 9: 1 lecture
• Chapter 10: 2 lectures
• Chapter 11: 1 lecture
• Chapter 12: 4 lectures
• Chapter 13: 2 lectures
• Chapter 14: 2 lectures
• PROBABLY: Advanced Topics: 3 lectures
• MAYBE: Chapter 7: 2 lectures

Schedule Discussion

• Mostly we work straight through the book. We occasionally skip sections.
• We decided to skip Chapter 7 in order to provide more room for advanced topics at the end of the semester. Possible topics:
  • Alternating minimization algorithms, Blahut-Arimoto, and Blahut algorithms
  • Channels with states, coding with side information, and information hiding
  • Error rate functions, R₀
• The schedule is ambitious, but necessary for a good introduction to this active research area.