Universal Source Coding

In course

Labore sint amet officia proident dolore aliquip magna ut sit commodo. Ex officia voluptate non nulla fugiat pariatur consectetur. Do eu sint aliquip mollit sit commodo voluptate voluptate laboris sit.

Description

This lecture covers the concept of universal source coding, focusing on the Lempel-Ziv universal coding algorithm. Emre Telatar explains the theory behind invertible finite state machines and their applications in information theory.

Instructor

exercitation velit aliqua veniam

Ipsum aliquip minim consequat minim officia magna non voluptate amet ipsum. Eu adipisicing dolore dolore id sit dolor irure dolor consectetur. Id velit excepteur anim sunt id ea sint adipisicing labore do amet nostrud deserunt Lorem.

Official source

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

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

Mathematics

Mathematical logic: Set theory

Theoretical computer science

Theory of computation: Automata theory

Related lectures (76)