Login to filter by course Login to filter by course Reset
Explores the Kraft-McMillan theorem, proving the existence of uniquely decodable prefix-free codes.
Covers entropy, source coding, encoding maps, decodability, prefix-free codes, and Kraft-McMillan's inequality.
Explains the key ingredients and processes of the JPEG compression algorithm, including block-level compression, smart quantization, and entropy coding.
Covers Shannon-Fano codes, a method for uniquely decodable and prefix-free coding, and discusses their optimality compared to the entropy.
Explores the Source Coding Theorem, entropy, Huffman coding, and conditioning's impact on entropy reduction.
Covers the concept of compression and constructing prefix-free codes based on given information.
Introduces Shannon's Theorem on binary codes, entropy, and data compression limits.
