- Syllabus
- Introduction
- Lecture video: here.
- What is information?
- How do we measure information?
- Lecture video: here. Old video: here.
- How do we measure information (entropy)?
- Lecture video: here.
- Example of entropy, self information and properties of entropy
- Joint self information and joint entropy
- Conditional self information and conditional entropy
- Lecture video: here.
- Chain rule
- Mutual information
- Lecture video: here.
- Conditional mutual information
- Relative entropy
- Lecture video: here.
- Relative entropy
- More on chain rule and more on mutual information
- Lecture video: here.
- More on chain rule and more on mutual information
- Four important inequalities
- Lecture video: here.
- Four important inequalities
- Jensen’s inequality
- Log sum inequality
- Lecture video: Here.
- Homework 1: 2.1-2.7, 2.9, 2.12, 2.14-2.16, 2.19, 2.20, 2.25, 2.29. Solution: here. Solution video: here.
- Four important inequalities
- Log sum inequality
- Data processing inequality
- Lecture video: Here.
- Four important inequalities
- Data processing inequality
- Fano’s inequality
- Information Source and Asymptotic Equipartition Property (AEP)
- Lecture video: Here.
- Asymptotic Equipartition Property (AEP)
- Lecture video: here.
- Asymptotic Equipartition Property (AEP)
- Data compression (source coding)
- Lecture video: here.
- Data compression (source coding)
- Source with memory
- Lecture video: here.
- Source with memory
- Entropy rate
- Entropy rate
- Hidden Markov Processes
- AEP for stationary ergodic processes
- Lossless source code
- Introduction
- Fixed-to-variable length code
- Lossless source code
- Fixed-to-variable length code
- Uniquely decodable and prefix code
- Kraft inequality
- Lossless source code
- Kraft inequality
- Optimal Codes
- Lecture video: here.
- Homework 2: 3.2, 3.9, 4.1, 4.3, 4.6, 4.7, 4.9, 4.11, 4.33, 5.1, 5.4, 5.6, 5.8, 5.12, 5.16, 5.24, 5.25, 5.30, 5.39. Solution: here. Solution video: part 1, part 2.
- Lossless source code
- Shannon codes
- Huffman codes
- Lossless source code
- Huffman codes
- The optimality of Huffman codes
- Lossless source code
- The optimality of Huffman codes
- Shannon-Fano-Elias Coding
- Lossless source code
- Mismatched Shannon Codes
- Competitive Optimality of Shannon Codes
- Universal Compression of Binary Sequences (Chapter 13)
- Lempel-Ziv (LZ78) Universal Compression (Chapter 13)
- Channel capacity
- Channel modeling
- Channel Capacity
- Channel capacity
- Channel Capacity
- Examples
- Channel capacity
- Examples
- An Optimization Theorem
- Channel capacity
- An Optimization Theorem (Z-channel example)
- Joint Typical Sequences
- Lecture video: here.
- Homework 3: 7.1, 7.2, 7.3, 7.4, 7.5, 7.7, 7.8, 7.9, 7.11, 7.12, 7.20, 7.35. Solution: here. Solution video: here.
- Channel capacity
- Proof of Channel Coding Theorem
- Channel capacity
- Proof of Channel Coding Theorem (continuing)
- Channel capacity
- Proof of Channel Coding Theorem (continuing)
- Feedback Capacity
- Channel capacity
- Feedback Capacity
- Source-Channel Separation Theorem
- Differential Entropy
- Relative Entropy of Continuous Random Variables
- Joint and Conditional Differential Entropy
- AEP for continuous Random Variables
- Properties
- Additive Noise
- Capacity of Additive White Gaussian Noise (AWGN) Channel
- Lecture video: here.
- Homework 4: 8.1, 8.2, 8.4, 8.5, 8.8, 8.9, 8.10, 9.1, 9.2, 9.3, 9.5, 9.6 9.7, 9.8. Solution: here. Solution video: here.
- Capacity of Additive White Gaussian Noise (AWGN) Channel
- Capacity of Other Channels
- Capacity of Other Channels
- Quantization
- Quantization
- Rate-Distortion Problem
- Examples
- Lecture video: here.
- Homework 5: 1, 10.2, 10.4, 10.5, 10.11, 10.12, 10.19. Solution: here. Solution video: here.
- Binary Source with Hamming Distortion
- Gaussian Source with Squared-Error Distortion
- The Analytical Method for Calculation of Rate-Distortion Function
- Arimoto-Blahut Algorithm
- Separation Theorem
- Parallel Gaussian Sources
Lecture 40 (Bonus, not required for the final exam)
- Network Information Theory: Distributed Source Coding