Lectures related to Variable-length code

Entropy and Algorithms: Twenty Questions Problem

Explores the Twenty Questions Problem, Huffman codes, and optimal querying strategies in algorithms, demonstrating efficient outcomes through prefix-free and ternary codes.

Compression: Strong Connection and Prefix-Free Codes

Explores the relationship between code word length and probability distribution, focusing on designing prefix-free codes for efficient compression.

Data Compression and Shannon's Theorem Summary

Summarizes Shannon's theorem, emphasizing the importance of entropy in data compression.

Compression: Prediction

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

Data Compression and Shannon-Fano Algorithm

Explores the Shannon-Fano algorithm for data compression and its efficiency in creating unique binary codes for letters.

Introduction to Julia & Simulation in Physics

Introduces Julia for computational physics, focusing on simulation methods and efficiency optimizations.

Conditional Entropy: Huffman Coding

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