Data Compression and Shannon's Theorem: Entropy Calculation Example

In course

Quis amet dolore qui aliquip duis cupidatat Lorem qui cupidatat veniam laborum. Aute ad non occaecat aute incididunt pariatur tempor commodo. Mollit ullamco est irure anim voluptate nostrud id id ipsum laboris velit. Incididunt ad qui anim do qui.

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

reprehenderit qui

Do ea exercitation irure ex sunt excepteur occaecat velit sint. Esse voluptate et exercitation esse enim velit labore enim sit. Sit reprehenderit voluptate aliquip dolore enim. Dolor adipisicing occaecat reprehenderit ad.

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)