The Huffman coding algorithm requires prior statistical knowledge about the information source and such information is often not available. The solution is to use Adaptive Huffman coding algorithm. Let’s assume the initial code assignment for both the encoder and decoder as follows.

Initial Code

NEW: 0

A: 00001

B: 00010

C: 00011

D: 00100

: :

For the symbol string AADCC,

(a) Please provide the Huffman tree after each step using the Adaptive Huffman coding algorithm.

(b) Please give the sequence of symbols and code (zeros and ones) being sent to the decoder.

Answer rating: 100% (QA)

In Adaptive Huffman coding the initial code assignment is usually a predefined code that is used unt... View the full answer