Textual description of firstImageUrl

Huffman Coding And Huffman Trees: How Computers Compress Text [The Basics - S01E03]

@ December 18, 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.


(by: Tom Scott)

  • Share:

You Might Also Like

0 comments