Adaptive Huffman Coding - Part 2

This tutorial covers the explanation of actual encoding and decoding in the Adaptive Huffman Coding algorithm. While doing the encoding and decoding, Huffman tree is constructed and updated on both encoding and decoding side. The tree constructed would be exactly the same on both sides thereby achieving the correct decoding. Encode (char inputChar) { if (inputChar node in Tree) { code = getCode(inputChar, Tree); updateTree(inputChar); } else { code = getCode(‘NYT’, Tree); code += asciiCode(inputChar); updateTree(inputChar); } return code; } Website: http://www.ideserve.co.in Facebook: https://www.facebook.com/IDeserve.co.in

Видео Adaptive Huffman Coding - Part 2 автора Теория групп: Сильные связи