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:    • Entropy in Compression - Computerphile  

EXTRA BITS: More on Huffman Trees:    • EXTRA BITS/TRITS - Huffman Trees - Co...  
Error Correction:    • Error Correction - Computerphile  

  / computerphile  
  / 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