文件列表:

Adaptive Huffman (0, 2015-11-24)
Adaptive Huffman\Adaptive Huffman (0, 2015-11-24)
Adaptive Huffman\Adaptive Huffman\complete_tre.m (2519, 2015-10-20)
Adaptive Huffman\Adaptive Huffman\get_codes.m (687, 2015-10-20)
Adaptive Huffman\Adaptive Huffman\interlevel.m (3204, 2015-10-20)
Adaptive Huffman\Adaptive Huffman\main.m (1085, 2015-10-20)
Adaptive Huffman\Adaptive Huffman\testingswap.m (1592, 2015-10-20)
Adaptive Huffman\Adaptive Huffman\tree.m (1270, 2015-10-20)
Adaptive Huffman\Adaptive Huffman\update_tree.m (995, 2015-10-20)
Adaptive Huffman\license.txt (1572, 2015-10-20)

% Code written for ADAPTIVE HUFFMAN coding technique: Start with 'main' function. Output at each symbol entry is calculated. tree: Takes tre, new symbol and wether the symbol is new or not Here tree has built by using cell array. REMEMBER: length of cell array is 2 if it has symbol and length is 1 when only node value is present. update_tree: updates tree i.e. adds up the node values in the tree. complete_tre: completes the tre by adding empty nodes wherever they are not present. Then it checks wether there is problem in the same level if problem is there then call to testingswap function In testing swap, match the maps of both the childs and they are swapped accordingly Then it checks wether there is problem in the upper and present level if problem is there then call to interlevel function Similarily like testing swap, here also we swap the childs by building maps (refer tree data structure for better understanding) get_codes: judging by the odd or even number of the node of the tree it can be predicted the code of it. If we go to left (2*i) in a binary tree then it is zero and to the right(2*i+1) then it is 1 op is build accordingly using op code.

近期下载者：

相关文件：

评论：[我要评论] [举报此文件]

收藏者：