Catalog · Principles of Discrete Applied Mathematics Lecture 16 of 20 Lecture 16: Data Compression and Shannon’s Noiseless Coding Theorem ← Previous Lecture 15: Max-Flow Min-Cut Theorem Next → Lecture 17: Huffman Coding ✓ Mark complete Materials Transcript (PDF) ↗ transcript