Chapter 3 – Huffman Coding
暂无分享,去创建一个
[1] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[2] Alistair Moffat,et al. Practical Length-limited Coding for Large Alphabets , 1995, Comput. J..
[3] Daniel S. Hirschberg,et al. Data compression , 1987, CSUR.
[4] Robert G. Gallager,et al. Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.
[5] Lawrence L. Larmore,et al. A fast algorithm for optimal length-limited Huffman codes , 1990, JACM.
[6] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.
[7] Solomon W. Golomb,et al. Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.
[8] Jeffrey Scott Vitter,et al. Design and analysis of dynamic Huffman codes , 1987, JACM.
[9] Donald E. Knuth,et al. Dynamic Huffman Coding , 1985, J. Algorithms.