Skip to content
Artwork for Computerphile
Computerphile · Today · 15 min

How Huffman Trees Work - Computerphile

How do we derive the most compact codes for a situation? Huffman Trees can help. Professor Brailsford explains how computer scientists like their trees to be upside down. "Entropy in Compression - Computerphile" precedes this: http://www.youtube.com/watch?v=M5c_RFKVkko EXTRA BITS: More on Huffman Trees: http://www.youtube.com/watch?v=DV8efuB3h2g Error Correction: http://www.youtube.com/watch?v=5sskbSvha9M http://www.facebook.com/computerphile https://twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: http://bit.ly/nottscomputer Computerphile is a sister project to Brady Haran's Numberphile. See the full list of Brady's video projects at: http://bit.ly/bradychannels Learn more about your ad choices. Visit megaphone.fm/adchoices

0:00-15:51

transcript

No transcript — this publisher did not publish one.

show notes

How do we derive the most compact codes for a situation? Huffman Trees can help. Professor Brailsford explains how computer scientists like their trees to be upside down.

"Entropy in Compression - Computerphile" precedes this: http://www.youtube.com/watch?v=M5c_RFKVkko

EXTRA BITS: More on Huffman Trees: http://www.youtube.com/watch?v=DV8efuB3h2g
Error Correction: http://www.youtube.com/watch?v=5sskbSvha9M

http://www.facebook.com/computerphile
https://twitter.com/computer_phile

This video was filmed and edited by Sean Riley.

Computer Science at the University of Nottingham: http://bit.ly/nottscomputer

Computerphile is a sister project to Brady Haran's Numberphile. See the full list of Brady's video projects at: http://bit.ly/bradychannels

Learn more about your ad choices. Visit megaphone.fm/adchoices

links8