How Computers Compress Text: Huffman Coding and Huffman Trees
- Published on: 11 September 2017
- Computers store text (or, at least, English text) as eight bits per character. There are plenty of more efficient ways that could work: so why don't we use them? And how can we fit more text into less space? Let's talk about Huffman coding, Huffman trees, and Will Smith.
Thanks to the Cambridge Centre for Computing History: http://www.computinghistory.org.uk/
Thanks to Chris Hanel at Support Class for the graphics: http://supportclass.net
Filmed by Tomek: https://youtube.com/tomek
And thanks to my proofreading team!
I'm at http://tomscott.com
on Twitter at http://twitter.com/tomscott
on Facebook at http://facebook.com/tomscott
and on Snapchat and Instagram as tomscottgo
- Runtime : 6:31
- tom scott tomscott the basics computer science huffman coding compression huffman tree lossless compression