A note on D-ary Huffman codes
暂无分享,去创建一个
[1] Alfredo De Santis,et al. Tight upper bounds on the redundancy of Huffman codes , 1989, IEEE Trans. Inf. Theory.
[2] Jovan Dj. Golic,et al. A lower bound on the redundancy of D-ary Huffman codes , 1987, IEEE Trans. Inf. Theory.
[3] Gyula O. H. Katona,et al. Huffman codes and self-information , 1976, IEEE Trans. Inf. Theory.
[4] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[5] Robert G. Gallager,et al. Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.
[6] Julia Abrahams,et al. On the redundancy of optimal binary prefix-condition codes for finite and infinite sources , 1987, IEEE Trans. Inf. Theory.
[7] Inder Jeet Taneja,et al. Bounds on the redundancy of Huffman codes , 1986, IEEE Trans. Inf. Theory.
[8] B. V. K. Vijaya Kumar,et al. On the average codeword length of optimal binary codes for extended sources , 1987, IEEE Trans. Inf. Theory.
[9] Ottar Johnsen,et al. On the redundancy of binary Huffman codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.