Unbounded Length Contexts for PPM

Computer Journal

Volumn 40, Issue 2-3, 1997, Pages

  Cleary, John G ^a   Teahan, W J ^a  

^a UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0003081845     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/40.2_and_3.67     Document Type: Article

References (25)

1. Cleary, J. G. and Witten, I. H. (1984) Data compression using adaptive coding and partial string matching. IEEE Trans. Commun., COM-32, 396-402.
2. Moffat, A. (1990) Implementing the PPM data compression scheme. IEEE Trans. Commun., COM-38, 1917-1921.
3. Ziv, J. and Lempel, A. (1977) A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, IT-23, 337-343.
4. Ziv, J. and Lempel, A. (1978) Compression of individual sequences via variable rate coding. IEEE Trans. Inform. Theory, IT-24, 530-536.
5. Bell, T. C., Cleary, J. G. and Witten, I. H. (1990) Text Compression. Prentice-Hall, Englewood Cliffs, NJ.
6. Moffat, A., Neal, R. and Witten, I. H. (1995) Arithmetic coding revisited. Proc. Data Compression Conf. IEEE Computer Society Press, Los Alamitos, CA.
7. Witten, I. H., Neal, R. M. and Cleary, J. G. (1987) Arithmetic Coding for Data Compression. Commun. ACM, 30, 520-540.
8. Bunton, S. (1997) Semantically motivated improvements for PPM variants. Comp. J., 40, in press.
9. Teahan, W. J. and Cleary, J. G. (1996) The entropy of English using PPM based models. Proc. Data Compression Conf., pp. 53-62. IEEE Computer Society Press, Los Alamitos, CA.
10. Shannon., C. E. (1951) Prediction and entropy of printed English. Bell Syst. Tech. J., 30, 50-64.
11. Wilson, W. J. (1994) Chinks in the armor of public key cryptosystems. Technical Report 94/3, University of Waikato, Hamilton, New Zealand.
12. Witten, I. H. and Bell, T. C. (1991) The zero-frequency problem: estimating the probabilities of novel events in adaptive text compression. IEEE Trans. Inform. Theory, IT-37, 1085-1094.
13. Teahan, W. J. (1997) Modelling English Text. D.Phil. Thesis, University of Waikato, New Zealand.
14. Sedgewick, R. (1988) Algorithms. Addison-Wesley, Reading, MA.
15. Ukkonen, E. (1995) On-line construction of suffix trees. Algorithmica, 14, 249-260.
16. Larsson, N. J. (1996) Extended application of suffix trees to data compression. Proc. Data Compression Conf., pp. 190-199. IEEE Computer Society Press, Los Alamitos, CA.
17. Bunton, S. (1996) On-line Stochastic Process in Data Compression. Ph.D. Thesis, University of Washington.
18. Burrows, M. and Wheeler, D. J. (1994) A block-sorting lossless data compression algorithm. Technical Report, Digital Equipment Corporation, Palo Alto, CA.
19. Horspool, R. N. and Cormack, G. V. (1986) Dynamic Markov modelling - a prediction technique. Proc. Int. Conf. on the System Services, Honolulu, Hawaii.
20. Bell, T. C. and Moffat, A. M. (1989) A note on the DMC data compression scheme. Comp. J., 32, 16-20.
21. Fiala, E. R. and Green, D. H. (1989) Data compression with finite windows. Commun. ACM, 32, 490-505.
22. Åberg, J., Shtarkov, Y. M. and Smeets, B. J. M. (1997) Towards understanding and improving escape probabilities in PPM. Proc. Data Compression Conf. IEEE Computer Society Press, Los Alamitos, CA.
23. Bloom, C. (1996) PPMZ. http://wwwvms.utexas.edu/~cbloom
24. DeMori, R. and Kuhn, R. (1990) A cache-based natural language model for speech recognition. IEEE Trans. Patt. Anal. Machine Intell., PAMI-12, 570-583.
25. Cleary, J. G., Teahan, W. J. and Witten, I. H. (1995) Unbounded length contexts for PPM. Proc. Data Compression Conf., pp. 52-61 IEEE Computer Society Press, Los Alamitos, CA.