Huffman Codes:

Assume an alphabet with 9 characters: T O H F A R N M Q

Assume the probabilities of usage of the different characters are as: 0.19 0.23 0.34 0.4 0.11 0.099 0.09 0.21 0.12.

- What will be the codes assigned to each character, using Hoffman-tree?

T:

O:

H:

F:

A:

R:

N:

M:

Q:

- The binary representation for the message below using Huffman coding will be?

RAMQOA

- If the transmitted message is 1110111101111101111111111111110, what is the transmitted message in characters?