For an alphabet of n symbols the most frequent symbol needs 1 bit and the least frequent needs n-1. These are the trees for alphabets of size 5 and 10.

Advertisements

Skip to content
# Exercise 2.71

For an alphabet of n symbols the most frequent symbol needs 1 bit and the least frequent needs n-1. These are the trees for alphabets of size 5 and 10.

Advertisements

%d bloggers like this: