Two Corollaries to the Huffman Coding Procedure
- 1 May 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 21 (3) , 342-344
- https://doi.org/10.1109/tit.1975.1055365
Abstract
For a given set ofNsymbols to be coded by a code of alphabet sizeD, the necessary and sufficient conditions for the optimality of a block code of lengthm, ifN = D^m, and the optimality of a code of words of length onlymandm + 1, ifD^m < N < D^{m+1}, are stated, and an example of the construction of such a code is given.Keywords
This publication has 1 reference indexed in Scilit:
- A Method for the Construction of Minimum-Redundancy CodesProceedings of the IRE, 1952