Information Theory: Prefix-Free Codes

In course

Pariatur magna voluptate quis ea laborum. Laborum aliqua aute ea elit aliquip. Exercitation nostrud laborum magna fugiat eiusmod ex cillum qui laborum consectetur. Nulla ipsum est commodo qui Lorem laboris commodo. In esse laboris fugiat id voluptate elit consequat irure eu magna excepteur non.

Description

This lecture covers the concept of prefix-free codes, including the Kraft inequality, Huffman coding, and entropy. Emre Telatar explains how to design efficient codes and analyze their properties.

Instructor

Ad ex consectetur voluptate reprehenderit nostrud consectetur voluptate nulla tempor sunt pariatur. Deserunt minim minim reprehenderit ad in officia anim adipisicing. Non id cupidatat laborum eu irure excepteur duis duis tempor.

Official source

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

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

Information theory: Coding theory

Related lectures (33)