|
Spring 2017
ECE 696B: Network Information Theory for Engineering Applications
Lecture Notes
Lecture 1: Entropy, Relative Entropy
Lecture 2: Mutual Information, Jensen's Inequality and Applications
Lecture 3: Data Processing Inequality, Fano's Inequality
Lecture 4: Asymptotic Equipartition Property (AEP) & Source Coding
Lecture 5: Channel Capacity
Lecture 6: Channel Coding Theorem
Lecture 7: Differential Entropy and Gaussian Channels
Lecture 8: Parallel Channel, Capacity of MIMO
Lecture 9: Multi-variate AEP
Lecture 10: Multiple Access Channel
Lecture 11: Information Theory of Cache Enabled Networks
Lecture 12: Coded Caching (warmup examples)
Lecture 13: Coded Caching (general results)
Lecture 14: Coded MapReduce (part I)
Lecture 15: Coded MapReduce (part II)
Lecture 16: Private Information Rerieval (part I)
Lecture 17: Private Information Rerieval (part II)
Lecture 18: Private Information Rerieval (part III)
Lecture 19: Max-Flow Min-Cut
Lecture 20: Network Coding (basics)
Lecture 21: Coding for Storage
Lecture 22: Network Coding for Distributed Storage
Lecture 23: Minimum Storage Regenerating (MSR) Codes
Lecture 24: Minimum Bandwidth Regenerating (MBR) Codes
Lecture 25: Information Theory for DNA Sequencing
|