DocumentCode
21250
Title
Huffman Redundancy for Large Alphabet Sources
Author
Narimani, H. ; Khosravifard, Mohammadali
Author_Institution
Dept. of Electr. & Comput. Eng., Isfahan Univ. of Technol., Isfahan, Iran
Volume
60
Issue
3
fYear
2014
fDate
Mar-14
Firstpage
1412
Lastpage
1427
Abstract
The performance of optimal prefix-free encoding for memoryless sources with a large alphabet size is studied. It is shown that the redundancy of the Huffman code for almost all sources with a large alphabet size n is very close to that of the average distribution of the monotone sources with n symbols. This value lies between 0.02873 and 0.02877 bit for sufficiently large n.
Keywords
Huffman codes; redundancy; source coding; Huffman code; Huffman redundancy; average distribution; large alphabet sources; memoryless sources; monotone sources; optimal prefix-free encoding; Channel coding; Histograms; Huffman coding; Random variables; Redundancy; Vectors; Huffman redundancy; average monotone source; memoryless source; monotone source;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2013.2294832
Filename
6681930
Link To Document