Prove the following two properties of the Huffman encoding scheme. (a) If some character occurs with frequency more than 2=5, then there is guaranteed to be a codeword of length 1. (b) If all characters occur with frequency less than 1=3, then there is guaranteed to be no codeword of length 1.

Question

Nathalie Faulkner

27 October, 10:06

+4

Answers (1)

Know the Answer?

Billie · Answer 1

Try to add it up and see if it's correct if not try the inverse method