Lecture 16: Data Compression and Shannon’s Noiseless Coding Theorem
We start with the history of data compression. We define a first-order source, and what it means to compress it. We define entropy. We then state and prove Shannon’s noiseless coding theorem, which gives the optimal compression ratio a first-order source.
Viewing videos requires an internet connection
Course Info
Instructors
Departments
As Taught In
Spring
2024
Level
Topics
Learning Resource Types
theaters
Lecture Videos
notes
Lecture Notes
assignment
Problem Sets
Editable Files
