Lectures related to Data Compression and Shannon's Theorem: Lossy Compression

Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.

Covers source coding theorems, entropy, and various source models in information theory.

Explores lossless compression using Shannon-Fano and Huffman algorithms, showcasing Huffman's superior efficiency and speed over Shannon-Fano.

Explores conditional entropy and Huffman coding for efficient data compression techniques.

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