Title :
Huffman coding with an infinite alphabet
Author :
Kato, Akiko ; Sun Han, Te ; Nagaoka, Hiroshi
Author_Institution :
Graduate Sch. of Inf. Syst., Univ. of Electro-Commun., Tokyo, Japan
fDate :
5/1/1996 12:00:00 AM
Abstract :
A new type of sufficient condition is provided for a probability distribution on the nonnegative integers to be given an optimal D-ary prefix code by a Huffman-type algorithm. In the justification of our algorithm, we introduce two new (essentially one) concepts as the definition of the “optimality” of a prefix D-ary code, which are shown to be equivalent to that defined in the traditional way. These new concepts of the optimality are meaningful even for the case where the Shannon entropy H(P) diverges
Keywords :
Huffman codes; entropy; probability; source coding; Huffman coding; Huffman-type algorithm; Shannon entropy; infinite alphabet; integer coding; nonnegative integers; optimal D-ary prefix code; optimality; probability distribution; sufficient condition; Entropy; Huffman coding; Partitioning algorithms; Probability distribution; Sufficient conditions; Sun; Tellurium;
Journal_Title :
Information Theory, IEEE Transactions on
