4.8 Huffman Codes
These lecture slides are supplied by Mathijs de Weerd
Data Compression
Q. Given a text that uses 32 symbols (26 different letters, space, and
some punctuation characters), how can we encode this text in bits?
Q. Some symbols (e, t, a, o,
1st Problem:
In order to find the topological ordering of the above graph, first we need to find
the first node, which is the one that has no edges coming into it. In our case is A.
Our next step should be to find the last node, which is the