Data Compression Using a Sort-Based Context Similarity Measure

Computer Journal

Volumn 40, Issue 2-3, 1997, Pages

  Yokoo, Hidetoshi ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (18)

1. Bell, T. C., Cleary, J. G. and Witten, I. H. (1990) Text Compression. Prentice Hall, Englewood Cliffs, NJ.
2. Cleary, J. G. and Witten, I. H. (1984) Data compression using adaptive coding and partial string matching. IEEE Trans. Commun., COM-32, 396-402.
3. Weinberger, M. J., Rissanen, J. J. and Feder, M. (1995) A universal finite memory source. IEEE Trans. Inform. Theory, IT-41, 643-652.
4. Willems, F. M. J., Shtarkov, Y. M. and Tjalkens, T. J. (1995) The context-tree weighting method: basic properties. IEEE Trans. Inform. Theory, IT-41, 653-664.
5. Burrows, M. and Wheeler, D. J. (1994) A block-sorting lossless data compression algorithm. SRC Research Report, Vol. 124.
6. Cleary, J. G., Teahan, W. J. and Witten, I. H. (1995) Unbounded length contexts for PPM. In Storer, J. A. and Conn, M. (eds.), DCC '95 Proc. Data Compression Conf., Snowbird, UT, March, pp. 52-61. IEEE Computer Society Press, Los Alamitos, CA.
7. Fenwick, P. M. (1996) Block sorting text compression. ACSC'96, Proc. 19th Australian Computer Science Conf., Melbourne, Australia.
8. Fenwick, P. M. (1996) Block-sorting text compression Final Report. Technical Report 130, Department of Computer Science, University of Auckland, Auckland, New Zealand. Available at: ftp://www.cs.auckland.ac.nz/out/peter-f/TechRep130.ps.
9. Fenwick, P. M. (1996) Symbol ranking text compression. Technical Report 132, Department of Computer Science, University of Auckland, Auckland, New Zealand. Available at: ftp://www.cs.auckland.ac.nz/out/peter-f/TechRep132.ps.
10. Shannon, C. E. (1951) Prediction and entropy of printed English. Bell Syst. Tech. J., 30, 50-64.
11. Howard, P. G. and Vitter, J. S. (1993) Design and analysis of fast text compression based on quasi-arithmetic coding. In Storer, J. A. and Conn, M. (eds), DCC '93 Proc. Data Compression Conf., Snowbird, UT, pp. 98-107. IEEE Computer Society Press, Los Alamitos, CA.
12. Elias, P. (1975) Universal codeword sets and representations of the integers. IEEE Trans. Inform. Theory, IT-21, 194-203.
13. Yokoo, H. and Takahashi, M. (1996) Data compression by context sorting. IEICE Trans. Fundamentals, E79-A, 681-686.
14. Bell, T. C. (1986) Better OPM/L text compression. IEEE Trans. Commun., COM-34, 1176-1182.
15. Ziv, J. and Lempel, A. (1977) A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, IT-23, 337-343.
16. Moffat, A. M. (1990) Implementing the PPM data compression scheme. IEEE Trans. Commun., COM-38, 401-406.
17. Ziv, J. (1978) Coding theorems for individual sequences. IEEE Trans. Inform. Theory, IT-24, 405-412.
18. Hoang, D. T., Long, P. M. and Vitter, J. S. (1995) Multiple-dictionary compression using partial matching. In Storer, I. A. and Cohn, M. (eds), DCC '95 Proc. Data Compression Conf., Snowbird, UT, pp. 272-281. IEEE Computer Society Press, Los Alamitos, CA.