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.
This lecture covers the fundamentals of source coding, including entropy, data compression, and the concept of prefix-free codes. It explains how entropy is a crucial bound for algorithms and guides the design of efficient compression algorithms. The lecture also delves into the construction and properties of prefix-free codes, which ensure unique decodability and efficient encoding.