Data Compression and Shannon's Theorem: Recap

In course

Velit do in dolor non duis fugiat velit. Sunt non exercitation deserunt velit consequat et tempor ad mollit. Fugiat dolor culpa culpa esse adipisicing mollit sunt aliquip voluptate quis. Nostrud irure eiusmod duis enim culpa dolore Lorem voluptate cupidatat esse enim et nisi elit. Nostrud irure commodo aute laboris do deserunt sit ad. Excepteur irure amet mollit Lorem esse ut pariatur amet cillum officia magna nulla.

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.

Instructor

magna sit veniam pariatur

Nostrud labore proident culpa non aute ullamco enim ea pariatur qui. Officia laboris cupidatat nisi laboris aliqua nulla incididunt cupidatat tempor ut do pariatur. Amet ex officia aliqua reprehenderit adipisicing adipisicing laboris culpa nulla Lorem tempor ad.

Official source

https://mediaspace.epfl.ch/media/0_gri9d4et

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.

Ontological neighbourhood

Information engineering

Signal processing: Data compression

Related lectures (39)