- T. Bell, J.G. Cleary, and I.H. Witten,
*Text Compression*. Prentice-Hall, Englewood Cliffs, NJ, 1990. - J.D. Gibson, T. Berger, T. Lookabaugh, D. Lindberg, and R.L. Baker,
*Digital Compression for Multimedia*. Morgan Kaufmann, San Francisco, 1998. - M. Nelson and J. Gailly,
*The Data Compression Book*, 2nd edition. M & T Books, New York, 1996. - K. Sayood,
*Introduction to Data Compression*, 2nd ed. Morgan Kaufmann, San Francisco, 2000. - D. Salomon,
*Data Compression: The Complete Reference*. Springer-Verlag, New York, 1998. - I.H. Witten, A. Moffat, and T.C. Bell,
*Managing Gigabytes: Compressing and Indexing Documents and Images*, 2nd ed., Morgan Kaufmann, San Francisco, 1999.

- Introduction
- [EnglishEntropy]
T.M. Cover and R.C. King,
"A convergent gambling estimate of the entropy of English,"
*IEEE Trans. on Info. Theory 24*(1978) 413-421.

- [EnglishEntropy]
T.M. Cover and R.C. King,
"A convergent gambling estimate of the entropy of English,"
- Codes
- Coding Techniques
- [Huffman]
D.A. Huffman,
"A method for construction of minimum-redundancy codes,"
*Proc. of the IRE 40*(1952) 1098-1101. - [Adaptive Huffman]
J.S. Vitter,
"Design and analysis of dynamic Huffman codes,"
*J.ACM 34*(1987) 825-845. - [LenLim Huff]
L.L. Larmore and D.S. Hirschberg,
"A fast algorithm for optimal length-limited codes,"
*Journal ACM 37*(1990) 464-473. - [Tunstall]
S. Savari,
"Variable-to-fixed length codes and plurally parsable dictionaries,"
*Proc. Data Compression Conf.*(1999) 453-462. - [ArithCoding]
I.H. Witten, R.M. Neal, and J.G. Cleary,
"Arithmetic coding for data compression,"
*Comm. ACM 30*(1987) 520-540. - [Q-coder]
W.B. Pennebaker, J.L. Mitchell, G.G. Langdon, and R.B. Arps,
"An overview of the basic principles of the Q-coder adaptive
binary arithmetic coder",
*IBM Journal of Research and Development 32*(1988) 771-726.

- [Huffman]
D.A. Huffman,
"A method for construction of minimum-redundancy codes,"
- Modeling
- [LZ77]
J. Ziv and A. Lempel,
"A universal algorithm for sequential data compression,"
*IEEE Trans. on Infor. Theory IT-23*(1977) 337-343. - [LZ77 optimality]
A.D. Wyner and J. Ziv,
"The sliding-window Lempel-Ziv algorithm is asymptotically optimal,"
*Proc. of the IEEE 82*(1994) 872-877. - [LZ78]
J. Ziv and A. Lempel,
"Compression of individual sequences via variable-rate coding"
*IEEE Trans. on Infor. Theory IT-24*(1978) 530-536. - [LZFG]
E.R. Fiala and D.H. Greene,
"Data compression with finite windows,"
*Comm. ACM 32*(1989) 490-505. - [LZSS]
J.A. Storer and T.G. Szymanski,
"Data compression via textual substitution,"
*Jour. ACM 29*(1982) 928-951. - [LZW]
T.A. Welch,
"A technique for high-performance data compression,"
*IEEE Computer 17*(1984) 8-19. - [PPM]
J.G. Cleary and W.J. Teahan, "Unbounded length contexts for PPM,"
*The Computer Journal 40*(1997) 67-75. - [PPM]
A. Moffat, "Implementing the PPM data compression scheme,"
*IEEE Trans. on Comm. COM-38*(1990) 1917-1921. - [Symbol Ranking]
P. Fenwick,
"Symbol ranking text compression with Shannon recodings,"
*J. of Universal Computer Science 3*(1997) 70-85. - [BWT]
M. Burrows and D.J. Wheeler,
"A block-sorting lossless data compression algorithm,"
*Digital Systems Research Center rpt. 124*(1994).

- [LZ77]
J. Ziv and A. Lempel,
"A universal algorithm for sequential data compression,"
- Text Compression Systems
- [CRC]
D.V. Sarwate,
"Computations of cyclic redundancy checks via table look-up,"
*CACM 31*(1988) 1008-1013.

- [CRC]
D.V. Sarwate,
"Computations of cyclic redundancy checks via table look-up,"
- Image Compression
- [CondlRLE]
H. Gharavi,
"Conditional run-length and variable-length coding
of digital pictures,"
*IEEE Trans. Commun. 35*(1987) 671-677. - [Progressive FELICS]
P.G. Howard and J.S. Vitter,
"Fast progressive lossless image compression,"
*Proc. 1994 IST/SPIE Int'l Symp. on Electronic Imaging Science and Technology*(1994). - [JPEG-LS]
M. Weinberger, G. Seroussi, and G. Sapiro,
"LOCO-I: A low complexity, context-based, lossless image compression
algorithm,"
*Proc. Data Compression Conf.*(1996) 140-149.

- [CondlRLE]
H. Gharavi,
"Conditional run-length and variable-length coding
of digital pictures,"
- Lossy Compression
- [Quantization]
A. Gersho,
"Quantization,"
*IEEE Communications Magazine 15*(Sep 1977). - [ViterbiAlg]
G.D. Fiorney, Jr.
"The Viterbi algorithm,"
*Proc. IEEE 61*(1973) 268-278. - [TrellisCodes]
M. Marcellin and T. Fischer,
"Trellis coded quantization of memoryless
and Gauss-Markov sources,"
*IEEE Trans. Commun. 38*(1990) 82-93. - [TrellisCodes]
M. Marcellin,
"On entropy-constrained trellis coded quantization,"
*IEEE Trans. Commun. 42*(1994) 14-16. - [LappedTransform]
H. Malvar and D. Staelin,
"The LOT: Transform coding without blocking effects,"
*IEEE Trans. Acoustics, Speech, & Signal Proc. 37*(1989) 553-559.

- [Quantization]
A. Gersho,
"Quantization,"
- Lossy Image Compression
- V. Bhaskaran and K. Konstantinides,
*Image and Video Compression Standards: Algorithms and Architectures*, Kluwer Academic Publishers, 1995. - A. Said and W.A. Pearlman,
"A New Fast and Efficient Image Codec Based on Set
Partitioning in Hierarchical Trees,"
*IEEE Transactions on Circuits and Systems for Video Technology 6*(1996) 243-250.

- V. Bhaskaran and K. Konstantinides,
- Audio Compression

Dan Hirschberg

Department of Information and Computer Science

University of California, Irvine, CA 92697-3425

Last modified: Nov 9, 2000