DocumentCode :
923157
Title :
Two Corollaries to the Huffman Coding Procedure
Author :
Geckinli, Nezih C.
Volume :
21
Issue :
3
fYear :
1975
fDate :
5/1/1975 12:00:00 AM
Firstpage :
342
Lastpage :
344
Abstract :
For a given set of 
symbols to be coded by a code of alphabet size 
, the necessary and sufficient conditions for the optimality of a block code of length 
, if 
, and the optimality of a code of words of length only and 
, if 
, are stated, and an example of the construction of such a code is given.
symbols to be coded by a code of alphabet size , the necessary and sufficient conditions for the optimality of a block code of length , if , and the optimality of a code of words of length only and , if , are stated, and an example of the construction of such a code is given.Keywords :
Block codes; Huffman codes; Block codes; Convergence; Convolution; Equations; Filters; Finite wordlength effects; Fourier transforms; Huffman coding; Sampling methods; Sufficient conditions;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1975.1055365
Filename :
1055365
Link To Document :
