Lectures related to Compression: Prefix-free Codes

Compression: Kraft Inequality

Explains compression and Kraft inequality in codes and sequences.

Compression: Prefix-Free Codes

Explains prefix-free codes for efficient data compression and the significance of uniquely decodable codes.

Information Theory: Source Coding & Channel Coding

Covers the fundamentals of information theory, focusing on source coding and channel coding.

Source Coding: Compression

Covers entropy, source coding, encoding maps, decodability, prefix-free codes, and Kraft-McMillan's inequality.

Entropy and Algorithms: Applications in Sorting and Weighing

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

Compression: Prediction

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

Stochastic Processes: Sequences and Compression

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

Compression

Covers the concept of compression and constructing prefix-free codes based on given information.

Data Compression and Shannon-Fano Algorithm

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

Data Compression and Shannon's Theorem: Entropy Calculation Example

Demonstrates the calculation of entropy for a specific example, resulting in an entropy value of 2.69.

Data Compression: Shannon-Fano Algorithm

Explores the Shannon-Fano algorithm for efficient data compression and its applications in lossless and lossy compression techniques.

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.

Shannon's Theorem MOOC: Information, Computation, Communication: Introduction to computational thinking

Introduces Shannon's Theorem on binary codes, entropy, and data compression limits.

Data Compression and Shannon's Theorem: Definitions

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

Source Coding Theorem

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

Data Compression and Shannon's Theorem: Lossy Compression

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

Data Compression and Shannon's Theorem Summary

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

Data Compression and Shannon's Theorem: Huffman Codes

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

JPEG 2000: Image Compression

Explores image compression principles, focusing on JPEG 2000, covering transform-based coding, quantization, entropy coding, region of interest, error resilience, and software implementations.

Data Compression and Shannon's Theorem: Shannon-Fano Coding

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