Utilities - Data Structures and Problem Solving Using Java - page 506

references

The original paper on Huffman's algorithm is [3]. Variations on the algorithm are
discussed in [2] and [4]. Another popular compression scheme is Ziv-Lempel
encoding, described in [7] and [6]. It works by generating a series of fixed-length
codes. Typically, we would generate 4,096 12-bit codes that represent the most
common substrings in the file. References [1] and [5] are good surveys of the
common compression schemes.

T. Bell, I. H. Witten, and J. G. Cleary, “Modelling for Text Compression,”
ACM Computing Surveys 21 (1989), 557-591.

1.

R. G. Gallager, “Variations on a Theme by Huffman,” IEEE Transactions
on Information Theory IT-24 (1978), 668-674.

2.

D. A. Huffman, “A Model for the Construction of Minimum Redundancy
Codes,” Proceedings of the IRE 40 (1952), 1098-1101.

3.

4.

D. E. Knuth, “Dynamic Huffman Coding,” Journal of Algorithms 6
(1985), 163-180.

5.

D. A. Lelewer and D. S. Hirschberg, “Data Compression,” ACM Comput-
ing Surveys 19 (1987), 261-296.

6.

T. A. Welch, “A Technique for High-Performance Data Compression,”
Computer 17 (1984), 8-19.

7.

J. Ziv and A. Lempel, “Compression of Individual Sequences via Variable-
Rate Coding,” IEEE Transactions on Information Theory IT-24 (1978),
530-536.