How Computers Compress Text: Huffman Coding and Huffman Trees

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! 🟥 MORE FROM TOM: https://www.tomscott.com/ (you can find contact details and social links there too) 📰 WEEKLY NEWSLETTER with good stuff from the rest of the internet: https://www.tomscott.com/newsletter/ ❓ LATERAL, free weekly podcast: https://lateralcast.com/ https://youtube.com/lateralcast/ ➕ TOM SCOTT PLUS: https://youtube.com/tomscottplus 👥 THE TECHNICAL DIFFICULTIES: https://youtube.com/techdif