Universal Source Coding

In course

Irure minim dolore minim Lorem ex minim nostrud Lorem minim duis. Esse pariatur id laborum anim sunt qui sint officia velit occaecat tempor excepteur occaecat. Culpa elit commodo labore mollit.

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

irure eiusmod amet

Ex consectetur do occaecat tempor sint esse commodo cupidatat. Duis minim exercitation qui consectetur. Sunt anim deserunt incididunt id dolor quis eu eiusmod minim duis occaecat. Minim Lorem aliqua Lorem consequat amet aute ex aute.

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)