Lecture

Data Compression and Shannon-Fano Algorithm

Description

This lecture covers the Shannon-Fano algorithm for data compression, introduced by Robert Fano, a pioneer in information theory. The algorithm assigns binary codes to letters based on the number of questions needed to guess them. By following specific rules, a unique code is created for each letter, ensuring a perfectly decodable message. The lecture demonstrates the application of the algorithm to the phrase 'IL FAIT BEAU A IBIZA,' showcasing the efficiency of the compression method and its relationship to entropy.

Instructor

culpa officia reprehenderit

Non velit deserunt voluptate enim incididunt deserunt id qui aliqua dolore deserunt pariatur cillum. Proident ex elit est do duis voluptate anim laborum elit eiusmod qui pariatur eiusmod. Id quis ad tempor occaecat esse officia sint non labore laboris laborum fugiat anim Lorem. Nisi cillum ipsum qui sit sint qui magna laboris ullamco nulla laboris pariatur exercitation in.

Official source

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

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

Signal processing: Data compression

Related lectures (44)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.