17 Aug 2004
CS 5244: Self-Study
10
Example, step V
¡Assign 0 to left
branches, 1 to right branches
¡Each encoding is a path
from the root
¡A = 0
B = 100
C = 1010
D = 1011
R = 11
B = 100
C = 1010
D = 1011
R = 11
¡Each path terminates
at a leaf
¡Do you see why
encoded strings are decodable?
