DocumentCode :
768693
Title :
Huffman code efficiencies for extensions of sources
Author :
Fenwick, P.M.
Author_Institution :
Dept. of Comput. Sci., Auckland Univ., New Zealand
Volume :
43
Issue :
38020
fYear :
1995
Firstpage :
163
Lastpage :
165
Abstract :
The efficiency of noiseless coding may be improved by coding extensions of the source; for large extensions the efficiency is arbitrarily close to unity. The paper shows that the efficiency is not always improved just by coding the next extension. In some cases the code of a larger extension is markedly less efficient than its predecessor, although always within the theoretical limits of efficiency. The author shows how the phenomenon arises from changes to the Huffman coding tree as the source probabilities change and investigates it for binary and ternary codes.<>
Keywords :
Huffman codes; source coding; tree data structures; Huffman code efficiencies; Huffman coding tree; binary codes; noiseless coding; source extensions; source probabilities; ternary codes; Huffman coding;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/26.380027
Filename :
380027
Link To Document :
بازگشت