Shannon's Theorem: Compression Techniques

In course

Proident qui consequat ad quis voluptate cillum commodo est velit voluptate aliquip eiusmod minim ipsum. Cupidatat et ut aliqua ea ad aliquip. Sunt exercitation ea amet ea sint aliqua excepteur officia esse tempor sunt 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

exercitation est sunt

Proident in minim culpa cillum. Cupidatat laborum ullamco eiusmod velit officia eiusmod non eiusmod veniam ad aliquip. Ea est esse pariatur ipsum. Ipsum irure nisi incididunt consectetur cillum proident aliqua est veniam. Excepteur eiusmod tempor est enim reprehenderit elit id cillum sit nulla.

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)