Lecture

Data Compression and Entropy 2: Entropy as 'Question Game'

Description

This lecture introduces the concept of entropy as a 'question game' where one must guess a randomly chosen letter by asking yes or no questions. Through examples and algorithms like Shannon-Fano, the instructor explains how entropy measures the minimum number of questions needed for guessing. The lecture also covers the relationship between entropy and data compression, illustrating how the frequency of letters in a sequence impacts the entropy value.

Instructor

ea sit

Amet ut qui incididunt elit sit reprehenderit. Labore laborum Lorem ea proident elit dolore aute qui. Eu sint minim nulla sint anim laboris. Sunt exercitation pariatur amet cillum tempor ad fugiat minim mollit consectetur consequat consequat. Excepteur dolor aliquip do culpa dolor aliqua nisi tempor.

Official source

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

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)

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.