How Huffman Trees Work - Computerphile
from Computerphile Hosted by 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=DV8efuB3h2gError Correction: http://www.youtube.com/watch?v=5sskbSvha9Mhttp://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://bit.ly/bradychannels
Embed this episode
No transcript yet.