Table 2 Codeword generation using quaternary Huffman principle
From: Balancing decoding speed and memory usage for Huffman codes using quaternary tree
Character | Frequency | Code |
|---|---|---|
Space | 8 | 00 |
A | 6 | 0100 |
E | 5 | 0101 |
T | 3 | 0110 |
N | 3 | 0111 |
F | 3 | 1000 |
R | 3 | 1001 |
H | 2 | 1010 |
I | 2 | 1011 |
S | 2 | 1100 |
M | 2 | 1101 |
U | 2 | 111000 |
X | 1 | 111001 |
P | 1 | 111010 |
L | 1 | 111011 |
O | 1 | 111100 |
Q | 1 | 111101 |
Y | 1 | 111110 |
. | 1 | 111111 |