DocumentCode
355869
Title
Asymptotic average redundancy of Huffman (and Shannon-Fano) block codes
Author
Szpankowski, Wojciech
Author_Institution
Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA
fYear
2000
fDate
2000
Firstpage
370
Abstract
A Huffman code is an iterative algorithm built over the associated Huffman tree, in which the two nodes with lowest weights are combined into a new node with a weight that is the sum of the weights of its two children. Such a construction is not unique but fortunately with a simple modification to the Huffman algorithm, it is possible to construct a unique Huffman code so that the longest codewords are as short as possible. Here we deal with such modified Huffman codes and present precise asymptotic results on the average redundancy of such codes for memoryless sources
Keywords
Huffman codes; block codes; memoryless systems; redundancy; source coding; Huffman codes; Shannon-Fano codes; asymptotic average redundancy; block codes; iterative algorithm; memoryless sources; Block codes; Computer science; Data compression; Entropy; IEEE Press; Information theory; Iterative algorithms; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2000. Proceedings. IEEE International Symposium on
Conference_Location
Sorrento
Print_ISBN
0-7803-5857-0
Type
conf
DOI
10.1109/ISIT.2000.866668
Filename
866668
Link To Document