How Huffman Trees Work - Computerphile

From the creator

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

Published 2013-10-18 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.