Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Data Compression and Shannon's Theorem: Recap
Description
This lecture covers the concepts of entropy, lossless compression, Shannon-Fano algorithm, Shannon's theorem, Huffman coding, and lossy compression. It explains how to represent sequences of letters efficiently using binary questions and answers. The instructor illustrates the principles with examples and discusses the optimal compression methods.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.