Lectures related to Stochastic Processes: Sequences and Compression

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

Explores entropy as a 'question game' to guess letters efficiently and its relation to data compression.

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

Discusses conditional entropy and its role in information theory and data compression.

Explains how to design efficient prefix-free codes for compression.

Explores Shannon's theorem on data compression and the performance of Shannon Fano codes.