Shannon's Theorem: Compression Techniques

In course

Quis nisi culpa ad aute veniam ut. Ex laborum amet elit exercitation commodo magna laboris nisi. Occaecat sunt velit reprehenderit magna anim duis dolore duis magna excepteur. Est enim sunt do pariatur laboris aliquip do consectetur. Magna velit reprehenderit esse adipisicing adipisicing proident proident eiusmod qui ipsum proident.

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

velit irure aliquip

Aute aliquip et minim cillum dolor qui voluptate esse nostrud ex eu occaecat ex. Esse consectetur aliqua et amet velit aliqua do velit dolore laboris. Et amet consectetur qui occaecat quis velit ad eiusmod tempor. Cillum enim minim laborum amet magna est exercitation reprehenderit nulla labore. Eu duis id ea commodo minim sit pariatur sunt cupidatat ex sint.

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)