On the redundancy of optimal codes with limited word length

Some limitations are given on the redundancy of D-ary codes with maximal codeword length L. An upper bound that improves on a previous result of E.N. Gilbert (1971) is given. It is then shown that the redundancy of these constrained codes is very close to that of the unconstrained Huffman codes when the number of codewords N is such that ND/sup 1-L/ becomes negligible. A tight bound is given on the redundancy when only the most likely probabilities are known. In the binary case, a tight lower bound is given on the redundancy when only the least likely probability is known. >

[1]  Shuichi Matsumoto,et al.  Algorithm for Construction of Variable Length Code with Limited Maximum Word Length , 1984, IEEE Trans. Commun..

[2]  Jan L. P. de Lameillieure.  A heuristic algorithm for the construction of a code with limited word length , 1987, IEEE Trans. Inf. Theory.

[3]  M. R. Garey,et al.  Optimal Binary Search Trees with Restricted Maximal Depth , 1974, SIAM J. Comput..

[4]  Ottar Johnsen,et al.  On the redundancy of binary Huffman codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[5]  Jan L. P. de Lameillieure.  Correction to 'A heuristic algorithm for the construction of a code with limited word length' (May 87 438-443) , 1988, IEEE Trans. Inf. Theory.

[6]  Alfredo De Santis,et al.  Tight upper bounds on the redundancy of Huffman codes , 1989, IEEE Trans. Inf. Theory.

[7]  T. C. Hu,et al.  Path Length of Binary Search Trees. , 1972 .

[8]  Jan L. P. de Lameillieure,et al.  Comment on "Algorithm for Construction of Variable Length Code with Limited Maximum Word Length" , 1986, IEEE Trans. Commun..

[9]  Lawrence L. Larmore,et al.  A fast algorithm for optimal length-limited Huffman codes , 1990, JACM.

[10]  Inder Jeet Taneja,et al.  Bounds on the redundancy of Huffman codes , 1986, IEEE Trans. Inf. Theory.

[11]  Edgar N. Gilbert,et al.  Codes based on inaccurate source probabilities , 1971, IEEE Trans. Inf. Theory.

[12]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[13]  Robert G. Gallager,et al.  Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.

[14]  Chung H. Lu.  Comment on 'algorithm for construction of variable length code with limited maximum word length' by H. Murakami et al , 1988, IEEE Trans. Commun..