Lectures related to Huffman's Algorithm: Mechanizing the Proof

Explores data compression, including lossless methods and the necessity of lossy compression for real numbers and signals.

Covers the concepts of compression and prediction using prefix-free codes and distributions.

Explores the Source Coding Theorem, entropy, Huffman coding, and conditioning's impact on entropy reduction.

Explores compression in stochastic processes through injective codes and prefix-free codes.

Explains Optimal Binary Search Trees using dynamic programming and covers a midterm exam from 2016.