Schedule
| No. | Topic | HTML | PS | |
| 1 | Introduction to Information Theory | HTML | PS | |
| 2 | Definitions and Basic Facts | HTML | PS | |
| 3 | Some More Bounds | HTML | PS | |
| 4 | Application of Information Theory to Blind Source Separation | HTML | PS | |
| 5 | The Asymptotic Equipartition Property | HTML | PS | |
| 6 | Entropy Rates | HTML | PS | |
| 7 | Data Compression | HTML | PS | |
| 8 | Arithmetic Coding | HTML | PS | |
| 9 | Channel Capacity | HTML | PS | |
| 10 | More on Channel Capacity | HTML | PS | |
| 11 | Differential Entropy | HTML | PS | |
| 12 | The Gaussian Channel | HTML | PS | |
| 13 | Bits and Queues | HTML | PS | |
| 14 | Maximum Entropy Estimation | HTML | PS |
Citation: admin. (2006, May 11). Schedule. Retrieved August 30, 2008, from Free Online Course Materials — USU OpenCourseWare Web site: http://ocw.usu.edu/Electrical_and_Computer_Engineering/Information_Theory/Schedule.html.
Copyright 2008,
Todd Moon.
This work is licensed under a
Creative Commons License.
