Processing math: 100%

5.Coding§

ASCII codes are fixed length (7 + 1 bits)
- In general, $n$ bits can store $2^n$ codes
An alternative is variable-length coding
The relative frequencies for eight selected letters.

$\begin{split}\begin{array}{|c|cccccccc|} \hline \textrm Letter & C & D & E & K & L & M & U & Z\\ \textrm Frequency & 32 & 42 & 120 & 7 & 42 & 24 & 37 & 2\\ \hline \end{array}\end{split}$

Huffman Coding Trees

1 / 16 Settings

<<<>>>

av_c1

32
C

42
D

120
E

7
K

42
L

24
M

37
U

2
Z

Saving...

Server Error
Resubmit

Assigning Codes

1 / 16 Settings

<<<>>>

av_c6

32
C

42
D

120
E

7
K

42
L

24
M

37
U

2
Z

7
K

2
Z

7
K

24
M

32
C

2
Z

7
K

24
M

37
U

42
D

107

42
L

32
C

2
Z

7
K

24
M

186

37
U

42
D

107

42
L

32
C

2
Z

7
K

24
M

306

120
E

186

37
U

42
D

107

42
L

32
C

2
Z

7
K

24
M

Saving...

Server Error
Resubmit

Using Codes

1 / 11 Settings

<<<>>>

av_c6

306

120
E

186

37
U

42
D

107

42
L

32
C

2
Z

7
K

24
M

Saving...

Server Error
Resubmit

Decoding

1 / 17 Settings

<<<>>>

av_c8

E
120

L
42

C
32

M
24

U
37

D
42

Z
2

K
7

Saving...

Server Error
Resubmit

Tree vs. Trie (1)

0 / 0 Settings

<<<>>>

We now add 18 to the tree. A split is made at 18.

Saving...

Server Error
Resubmit

Tree vs. Trie (2)

0 / 0 Settings

<<<>>>

We now want to add 45. This requires two splits. The first split is at value 48.

Saving...

Server Error
Resubmit