Multimedia Computing05 marksNumerical: Huffman codingHuffman coding algorithm
Let A = {a/20, b/15, c/5, d/15, e/45} be the alphabet and its frequency distribution. Now show how Huffman Coding works. Make your assumptions if required.
Let A = {a/20, b/15, c/5, d/15, e/45} be the alphabet and its frequency distribution. Now show how Huffman Coding works. Make your assumptions if required. [5]
Alphabet with frequencies: Symbol Frequency ------------------- a 20 b 15 c 5 d 15 e 45 Total frequency $= 20 + 15 + 5 + 15 + 45 = 100$ - Binary Huffman tree; left branch = 0, right branch = 1. - When combining, pick the two nodes with the smallest frequency (ties broken arbitrarily). $$c(5),\ b(...