|
293
|
Data Compression Using Adaptive Coding and Partial String Matching
– John G. Cleary, Ian, Ian H. Witten
- 1984
|
|
103
|
Unbounded Length Contexts for PPM
– John G. Cleary, W. J. Teahan, Ian H. Witten
- 1995
|
|
575
|
Text Compression
– TIMOTHY C BELL, JOHN G CLEARY, IAN H WITTEN
- 1990
|
|
106
|
Implementing the PPM data compression scheme
– A Moffat
- 1990
|
|
195
|
The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression
– I H Witten, T C Bell
- 1991
|
|
461
|
A block-sorting lossless data compression algorithm
– M. Burrows, D. J. Wheeler, M. Burrows, D. J. Wheeler
- 1994
|
|
965
|
A universal algorithm for sequential data compression
– Jacob Ziv, Abraham Lempel
- 1977
|
|
717
|
Managing Gigabytes: Compressing and Indexing Documents and Images - Errata
– I. H. Witten, A. Moffat, T. C. Bell
- 1996
|
|
42
|
Models of English text
– W. J. Teahan, John G. Cleary
- 1997
|
|
35
|
Extended Application of Suffix Trees to Data Compression
– N. Jesper Larsson
- 1996
|
|
584
|
Artihmetic coding for data compression
– I H Witten, R M Neal, J G Cleary
- 1987
|
|
612
|
Compression of Individual Sequences via Variable-Rate Coding
– Jacob Ziv, Abraham Lempel
- 1978
|
|
170
|
Arithmetic coding
– Glen G. Langdon
- 1979
|
|
120
|
The Context-Tree Weighting Method: Basic Properties
– Frans M. J. Willems, Yuri M. Shtarkov, Tjalling J. Tjalkens
- 1995
|
|
21
|
A comparison of enumerative and adaptive codes
– J G Cleary, I H Witten
- 1984
|
|
25
|
A note on Ziv-Lempel model for compressing individual sequences,” IEEE nansactions on Information Theory
– G G Langdon
- 1983
|
|
269
|
On-Line Construction of Suffix Trees
– Esko Ukkonen
- 1995
|
|
773
|
A method for the construction of minimum-redundancy codes
– D A Huffman
- 1952
|
|
69
|
Data Compression Using Dynamic Markov Modelling
– Gordon V. Cormack, R. Nigel Horspool
- 1986
|
