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
Description
This lecture discusses lossless data compression, where all letters are coded without exceptions, and the average code length is always greater than or equal to entropy. It explores the relationship between compression, entropy, and data loss, highlighting the threshold effect and the importance of not compressing below the entropy level.
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.