Data Compression and Shannon's Theorem: Entropy Calculation Example

In course

Labore nisi proident ipsum occaecat nostrud dolore exercitation laborum cupidatat enim. Laboris sint aliquip sunt aliqua incididunt cupidatat ut. Quis enim sit elit ullamco.

Description

This lecture focuses on calculating the entropy of a given example by determining the probabilities of letters and their frequencies of appearance, leading to a final entropy value of 2.69 for an average code length of 2.75.

Instructor

proident eiusmod ex

Proident excepteur est dolor est tempor quis minim. Proident consectetur aliquip proident mollit laborum quis Lorem. Velit ad id Lorem ipsum laboris commodo nostrud consectetur est. Aliqua deserunt in ad minim sit laborum laboris quis. Adipisicing aliqua dolore cillum sint mollit sunt ipsum laborum. Est deserunt consectetur duis labore velit velit qui qui nulla enim sunt ut pariatur irure. Consequat fugiat ut tempor qui ut nisi nulla cillum ea excepteur dolor sit laborum.

Official source

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

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

Mathematics

Probability theory: Topics in probability theory

Related lectures (89)