Adaptive Huffman Coding with Example Part 2
Part 1: Adaptive Huffman Tree • Adaptive Huffman Coding with Example |Part...
Part 3: Decoding • Adaptive Huffman Decoding Procedure With E...
Huffman encoding scheme is described in terms of the binary tree. We use squares for representing the external nodes or leaves and they correspond to the symbols in the source alphabets. The codewords assigned to each symbol can be determined by traversing the tree from root to leaf or node. Since it is a binary tree so we use 0 for the left branch and 1 for the right branch.
Now if we add two other parameters to this binary tree:
The weight of each leaf which is actually the number we write inside each node.
A node Number.
The weight of each external node represents the frequency or number of times a symbol is encountered in the list. The weight of internal nodes is equal to the summation of weights of its offspring nodes. The node number that we assign to an external and internal node is a unique number yi.
click here for reading the complete article:
https://eevibes.com/computing/adaptiv...
#huffmancoding #adaptivehuffmancode #huffmanccode #huffmanexample #eevibes #engineering #computerengineering #electricalengineering #datacompression #comprssiontechniques #coding #programming #computers #huffmanexample #example #uniqueexample