Word-based block-sorting text compression

Proceedings - 24th Australasian Computer Science Conference, ACSC 2001

Volumn , Issue , 2001, Pages 92-99

  Isal, R Y K ^a   Moffat, A ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BACKWARD WAVE TUBES;

ARITHMETIC CODERS; BASED MODELLING; BURROWS-WHEELER TRANSFORM; COMPRESSION MECHANISM; ENTROPY CODING; RESOURCE COSTS; TEXT COMPRESSIONS; WORD-BASED MODEL;

DATA COMPRESSION;

EID: 34547622455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSC.2001.906628     Document Type: Conference Paper

References (26)

1. Z. Arnavut. Move-to-front and inversion coding. In Storer and Cohn [2000], pages 193-202.
2. B. Balkenhol, S. Kurtz, and Y. M. Shtarkov. Modifications of the Burrows and Wheeler data compression algorithm. In Storer and Cohn [1999], pages 188-197.
3. J. L. Bentley, D. D. Sleator, R. E. Tarjan, and V. K. Wei. A locally adaptive data compression scheme. Communications of the ACM, 29(4):320-330, April 1986.
4. M. Burrows and D. J. Wheeler. A Block-Sorting lossless data compression algorithm. Technical Report 124, Digital Systems Research Center, Palo Alto, CA, May 1994.
5. J. G. Cleary and W. J. Teahan. Unbounded length contexts for PPM. The Computer Journal, 40(2/3):67-75, 1997.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Massachusetts, 1990.
7. E. S. de Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast searching on compressed text allowing errors. In W. B. Croft, A. Moffat, C. J. van Rijsbergen, R. Wilkinson, and J. Zobel, editors, Proc. 21st ACM SIGIR Conference, pages 298-306, New York, August 1998. ACM Press.
8. M. Effros. Universal lossless source coding with the Burrows Wheeler transform. In Storer and Cohn [1999], pages 178-187.
9. M. Effros. PPM performance with BWT complexity: A new method for lossless data compression. In Storer and Cohn [2000], pages 203-212.
10. P. Fenwick. Block sorting text compression. In K. Ramamohanarao, editor, Proc. 19th Australasian Computer Science Conference, pages 193-202, New York, January 1996. ACM Press.
11. J. L. Gailly. Gzip program and documentation, 1993. Source code available from ftp://prep.ai.mit.edu/pub/gnu/gzip-∗.tar.
12. R. N. Horspool and G. V. Cormack. Constructing word-based text compression algorithms. In J. A. Storer and M. Cohn, editors, Proc. 1992 IEEE Data Compression Conference, pages 62-71. IEEE Computer Society Press, Los Alamitos, California, March 1992.
13. A. Moffat. Word-based text compression. Software-Practice and Experience, 19(2):185-198, February 1989.
14. A. Moffat, R. M. Neal, and I. H. Witten. Arithmetic coding revisited. ACM Transactions on Information Systems, 16(3): 256-294, July 1998. Source software available from http : //www.cs.mu.oz.au/~alistair/arith-coder/.
15. A. Moffat, J. Zobel, and N. Sharman. Text compression for dynamic document databases. IEEE Transactions on Knowledge and Data Engineering, 9(2):302-313, March 1997.
16. B. Y. Ryabko. Technical correspondence: A locally adaptive data compression scheme. Communications of the ACM, 30(9):792, September 1987.
17. K. Sadakane. A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation. In J. A. Storer and M. Cohn, editors, Proc. 1998 IEEE Data Compression Conference, pages 129-138. IEEE Computer Society Press, Los Alamitos, California, March 1998.
18. K. Sadakane. Unifying Text Search and Compression-Suffix Sorting, Block Sorting and Suffix Arrays-. PhD thesis, The University of Tokyo, December 1999.
19. J. Seward. bzip2 and libbzip2. http://www.muraroa.demon.co.uk/, October 1998.
20. J. Seward. On the performance of BWT sorting algorithms. In Storer and Cohn [2000], pages 173-182.
21. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, July 1985.
22. J. A. Storer and M. Cohn, editors. Proc. 1999 IEEE Data Compression Conference, March 1999. IEEE Computer Society Press, Los Alamitos, California.
23. J. A. Storer and M. Cohn, editors. Proc. 2000 IEEE Data Compression Conference, March 2000. IEEE Computer Society Press, Los Alamitos, California.
24. A. Turpin and A. Moffat. Housekeeping for prefix coding. IEEE Transactions on Communications, 48(4):622-628, April 2000. Source code available from http://www.cs.mu.oz.au/~alistair/mr-coder/.
25. I. H. Witten, A. Moffat, and T. C. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco, California, second edition, 1999.
26. J. Zobel and A. Moffat. Adding compression to a full-text retrieval system. Software-Practice & Experience, 25(8):891-903, August 1995.