Design and Analysis of Dynamic Huffman Codes

Journal of the ACM (JACM)

Volumn 34, Issue 4, 1987, Pages 825-845

  Vitter, Jeffrey Scott ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Distributed computing; entropy; Huffman codes

Indexed keywords

COMPUTER NETWORKS; COMPUTER PROGRAMMING - ALGORITHMS;

DYNAMIC HUFFMAN CODES; FILE COMPRESSION; ONE-PASS ALGORITHM;

CODES, SYMBOLIC;

EID: 0023436103     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/31846.42227     Document Type: Article

References (10)

1. Bentley, J. L., Sleator, D. D., Tarjan, R. E., and Wei, V. K. A locally adaptive data compression scheme. Commun. ACM 29, 4 (Apr. 1986), 320–330.
2. Elias, P. Interval and recency-rank source coding: Two online adaptive variable-length schemes. IEEE Trans. Inf. Theory. To be published.
3. Faller, N. An adaptive system for data compression. In Record of the 7th Asilomar Conference on Circuits, Systems, and Computers. 1973, pp. 593–597.
4. Gallager, R. G. Variations on a theme by Huffman. IEEE Trans. Inf. Theory IT-24, 6 (Nov. 1978), 668–674.
5. Huffman, D. A. A method for the construction of minimum redundancy codes. In Proc. IRE 40 (1951), 1098–1101.
6. Knuth, D. E. Dynamic Huffman coding. J. Algorithms 6 (1985), 163–180.
7. McMaster, C. L. Documentation of the compact command. In UNIX User’s Manual, 4.2 Berkeley Software Distribution, Virtual VAX-11 Version, Univ. of California, Berkeley, Berkeley, Calif., Mar. 1984.
8. Schwartz, E. S. An Optimum Encoding with Minimum Longest Code and Total Number of Digits. Inf. Control 7, 1 (Mar. 1964), 37–44.
9. Vitter, J. S. Dynamic Huffman Coding. ACM Trans. Math. Softw. Submitted 1986.
10. Vitter, J. S., and Chen, W. C. Design and Analysis of Coalesced Hashing. Oxford University Press, New York, 1987.