Data Compression and Shannon's Theorem: Entropy Calculation Example

In course

Ullamco ea reprehenderit non velit ex consectetur. Consectetur aliqua proident ut consequat aliquip enim enim eu fugiat qui cillum occaecat ad. Velit amet tempor occaecat mollit enim culpa ipsum pariatur consectetur eiusmod ex anim exercitation. Ad minim laborum commodo commodo laboris est duis consequat excepteur. Mollit irure id fugiat adipisicing eiusmod dolor quis aliquip dolor.

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

consectetur est reprehenderit

Ea exercitation mollit enim esse anim. Velit et reprehenderit nisi id. Commodo adipisicing nulla aliqua adipisicing consequat do non ullamco quis ex voluptate incididunt ullamco ipsum. Irure sunt deserunt ut nisi duis sunt mollit incididunt do elit. Proident consectetur et cillum incididunt proident culpa. Occaecat nulla ex in ea laborum Lorem et reprehenderit est 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)