Data Compression Using Adaptive Coding and Partial String Matching (1984)

Cached

Download Links

by John G. Cleary , Ian , Ian H. Witten
Venue:IEEE Transactions on Communications
Citations:331 - 20 self

Documents Related by Co-Citation

619 Text Compression – T Bell, J Cleary, I Witten - 1990
1137 A universal algorithm for sequential data compression – Jacob Ziv, Abraham Lempel - 1977
662 Arithmetic coding for data compression – I H Witten, R M Neal, J G Cleary - 1987
117 Implementing the PPM Data Compression Scheme – Alistair Moffat - 1990
414 A technique for high-performance data compression – T Welch - 1984
733 Compression of Individual Sequences via Variable-Rate Coding – Jacob Ziv, Abraham Lempel - 1978
568 A block-sorting lossless data compression algorithm – M. Burrows, D. J. Wheeler, M. Burrows, D. J. Wheeler - 1994
236 Optimal Prefetching via Data Compression – Jeffrey Scott Vitter, P. Krishnan - 1995
111 Unbounded Length Contexts for PPM – John G. Cleary, W. J. Teahan, Ian H. Witten - 1995
160 A universal data compression system – J Rissanen - 1983
195 Arithmetic coding – Glen G. Langdon - 1979
139 Arithmetic coding revisited – Alistair Moffat, Radford M. Neal, Ian H. Witten - 1995
337 Prediction and entropy of printed English – Claude E Shannon - 1951
148 A locally adaptive data compression scheme – J Bentley, D Sleator, R Tarjan, V Wei - 1986
795 Managing Gigabytes: Compressing and Indexing Documents and Images - Errata – I. H. Witten, A. Moffat, T. C. Bell - 1996
942 A method for the construction of minimum-redundancy codes – D Huffman - 1952
69 A universal finite memory source – M J Weinberger, J Rissanen, M Feder - 1995
104 Universal modeling and coding – J Rissanen, G Landon - 1981
227 The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression – I Witten, T Bell - 1991