Media Summary: Computers store text (or, at least, English text) as eight bits per character. There are plenty of more efficient ways that could work: ... an explanation of the source coding theorem, Get your first two months of CuriosityStream free by going to and using the promo

Compression Basics Huffman Coding - Detailed Analysis & Overview

Computers store text (or, at least, English text) as eight bits per character. There are plenty of more efficient ways that could work: ... an explanation of the source coding theorem, Get your first two months of CuriosityStream free by going to and using the promo

Photo Gallery

How Computers Compress Text: Huffman Coding and Huffman Trees
Huffman coding step-by-step example
Text Compression with Huffman Coding
Compression Basics - Huffman Coding
Compressing text using Huffman trees worked example
these compression algorithms could halve our image file sizes (but we don't use them) #SoMEpi
Huffman Coding Explained | Compressing Text Step-by-Step
Huffman Coding Visually Explained
3.4 Huffman Coding - Greedy Method
Huffman Codes: An Information Theory Perspective
Compression: Crash Course Computer Science #21
The Limit of Compression | Huffman Coding
View Detailed Profile
How Computers Compress Text: Huffman Coding and Huffman Trees

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: ...

Huffman coding step-by-step example

Huffman coding step-by-step example

Another example for my students learning

Text Compression with Huffman Coding

Text Compression with Huffman Coding

Let's take a look at

Compression Basics - Huffman Coding

Compression Basics - Huffman Coding

In this video, we begin to look at the

Compressing text using Huffman trees worked example

Compressing text using Huffman trees worked example

Leran how to

these compression algorithms could halve our image file sizes (but we don't use them) #SoMEpi

these compression algorithms could halve our image file sizes (but we don't use them) #SoMEpi

an explanation of the source coding theorem,

Huffman Coding Explained | Compressing Text Step-by-Step

Huffman Coding Explained | Compressing Text Step-by-Step

Learn how

Huffman Coding Visually Explained

Huffman Coding Visually Explained

in this video, I've explained

3.4 Huffman Coding - Greedy Method

3.4 Huffman Coding - Greedy Method

How to

Huffman Codes: An Information Theory Perspective

Huffman Codes: An Information Theory Perspective

Huffman Codes

Compression: Crash Course Computer Science #21

Compression: Crash Course Computer Science #21

Get your first two months of CuriosityStream free by going to http://curiositystream.com/crashcourse and using the promo

The Limit of Compression | Huffman Coding

The Limit of Compression | Huffman Coding

What is the limit of

Huffman Coding (Lossless Compression Algorithm)

Huffman Coding (Lossless Compression Algorithm)

Talking about how