Lectures related to Data Compression: Source Coding

Explores Shannon-Fano coding for efficient data compression and its comparison to Huffman coding.

Explains binary codes, prefix-free codes, and representing letters with codes.

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

Explores the performance of Shannon-Fano algorithm and introduces Huffman codes for efficient data compression.

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

Covers the wrapping and decoding process of polar codes, exploring the trade-off between quality and efficiency in lossy compression.