Skip to content
Entropy in Compression - Computerphile episode artwork

Sep 6, 2026 16 min

Entropy in Compression - Computerphile

from Computerphile Hosted by Computerphile

What's the absolute minimum you can compress data to? - Entropy conjures up visions of chemistry and physics, but how does it apply to binary codes and computer science? Professor David Brailsford continues his discussion of compression.Addendum: the formula at 4:40 is the "weighted average bits for that state" rather than the total number of bits - (log^2)Original Professor Brailsford film on compression: http://youtu.be/Lto-ajuqW3w Professor Brailsford on Error Detection: http://youtu.be/-15nx57tbfchttp://www.facebook.com/computerphilehttps://twitter.com/computer_phileThis video was filmed and edited by Sean Riley.Computer Science at the University of Nottingham: http://bit.ly/nottscomputerComputerphile is a sister project to Brady Haran's Numberphile. See the full list of Brady's video projects at:http://periodicvideos.blogspot.co.uk/...

Episode details come from the podcast's RSS feed.

Embed this episode

Ready to play

Entropy in Compression - Computerphile

0:00 16:57

No transcript yet.

Requests help us decide what to transcribe next.

Frequently asked questions

How long is this episode of Computerphile?

This episode is 16 minutes long.

When was this Computerphile episode published?

This episode was published on September 6, 2026.

Can I download this Computerphile episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.