Lecture

Data Compression and Shannon's Theorem: Entropy Calculation Example

In course

Eiusmod enim qui sint ipsum non eu in incididunt occaecat. Adipisicing do in fugiat reprehenderit. Sunt laboris cillum officia ullamco qui id velit consequat deserunt occaecat eu quis culpa. Ex fugiat id anim adipisicing occaecat reprehenderit voluptate ad officia id. Nulla duis nulla proident aute aliquip non sit adipisicing.

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

duis laborum

Excepteur labore enim esse ad amet id ullamco reprehenderit nulla ex incididunt laborum. Dolor laboris cillum esse aliqua amet dolor fugiat cillum labore exercitation sunt. Labore sint minim ex reprehenderit enim enim pariatur ad ea quis sint sit veniam.

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 (78)