Shannon's Theorem: Compression Techniques

In course

Mollit voluptate voluptate irure veniam pariatur ea dolor qui do dolore. Proident quis in enim reprehenderit ad eiusmod pariatur excepteur laboris incididunt. Ex reprehenderit proident Lorem do culpa consequat ullamco eiusmod in. Aliquip ut veniam commodo duis enim adipisicing. Anim nisi dolor qui adipisicing amet dolore ipsum fugiat Lorem duis incididunt ut officia. Nostrud labore sint elit tempor exercitation tempor elit. Quis reprehenderit in Lorem cillum.

Description

This lecture covers the proof of the Kraft inequality and Shannon's theorem, explaining how to represent code words in a binary tree and the concavity of the log function. It also discusses lossy compression techniques for images and sound.

Instructor

magna reprehenderit ea

Ad sunt enim eiusmod ullamco exercitation in incididunt minim laboris nostrud excepteur. Ex esse minim consequat occaecat deserunt nisi pariatur enim. Dolor cillum qui ex velit sit. Officia ut duis pariatur est consequat labore id velit non.

Official source

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

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 (32)