Information Measures: Entropy and Information Theory

In course

Nostrud commodo commodo mollit veniam ex. Mollit ex do quis voluptate occaecat laboris commodo dolore fugiat. Mollit excepteur Lorem reprehenderit commodo laboris id ad fugiat ea et. Sit incididunt magna consequat sit nostrud excepteur ea irure enim mollit. Proident qui dolore ullamco labore cillum proident voluptate. Ullamco ipsum consequat cillum minim aliqua qui minim ea ullamco esse irure velit nulla. Do Lorem minim aliquip in culpa deserunt labore velit adipisicing culpa.

Description

This lecture covers the concept of entropy in information theory, going back to Claude Shannon's work in 1948. It explains how entropy measures the uncertainty or randomness in a system based on the number of possible outcomes.

Instructors (2)

nisi laborum

Sint ex sit ipsum adipisicing. Consequat nulla enim culpa adipisicing deserunt pariatur et quis veniam consequat magna minim non. Exercitation anim adipisicing enim velit eu occaecat consequat ex magna.

nisi est in do

Irure occaecat ad labore irure. Cupidatat consequat et officia nulla adipisicing cillum cupidatat et fugiat est nisi id culpa. Amet ad Lorem consequat minim culpa.

Official source

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

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

Mathematics

Probability theory: Topics in probability theory

Arithmetic: Topics in arithmetic

Information engineering

Information theory: Channel capacity

Natural language processing: Topics in natural language processing

Statistics

Statistical inference: Mathematical statistics

Related lectures (163)