Table 1 Codeword generation using binary Huffman principle
From: Balancing decoding speed and memory usage for Huffman codes using quaternary tree
Character | Frequency | Code |
|---|---|---|
Space | 8 | 000 |
A | 6 | 010 |
E | 5 | 101 |
T | 3 | 1000 |
N | 3 | 1001 |
F | 3 | 0110 |
R | 3 | 0111 |
H | 2 | 1101 |
I | 2 | 00110 |
S | 2 | 00111 |
M | 2 | 00100 |
U | 2 | 00101 |
X | 1 | 11001 |
P | 1 | 110000 |
L | 1 | 110001 |
O | 1 | 11110 |
Q | 1 | 11111 |
Y | 1 | 11100 |
. | 1 | 11101 |