PPM performance with BWT complexity: A fast and effective data compression algorithm

Proceedings of the IEEE

Volumn 88, Issue 11, 2000, Pages 1703-1712

  Effros, Michelle ^a  

^a California Institute of Technology   (United States)

Author keywords

Burrows wheeler transform; Lossless source coding; Prediction by partial mapping algorithm; Suffix trees; Text compression

Indexed keywords

EID: 0013282886     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/5.892706     Document Type: Article

References (22)

1. J. G. Cleary and I. H. Witter., "Data compression using adaptive coding and partial string matching," IEEE Trans. Commun., vol. 32, pp. 396-402, Apr. 1984.
2. J. G. Cleary, W. J. Teahan, and I. H. Witten, "Unbounded length contexts for PPM," in Proc. Data Compression Conf. Snowbird, UT: IEEE, Mar. 1995, pp. 52-61.
3. [3j T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression. Eaglewood Cliffs, NJ: Prentice-Hall, 1990.
4. [41 R. Arnold and T. Beil, "A corpus for the evaluation of lossless compression algorithms," in Proc: Data Compression Conf. Snowbird. UT: IEEE, Mar. 1997, pp. 201-210.
5. J. Ziv and A. Leinpel, "A universal algorithm for sequential data compression," IEEE Trans. Inform. Theory, vol. IT-23, pp. 337-343, May 1977.
6. _, "Compression of individual sequences via variable-rate coding," IEEE Trims. Inform. Theory, vol. IT-24, pp. 530-536, Sept. 1978.
7. T. A. Welch, "A technique for high-performance data compression," IEEE Comput., vol. 17, pp. 8-19, June 1984.
8. M. Rodeh, V. R. Pratt, and S. Even, "Linear algorithm for data compression via string matching," J. Assoc. Comput. Mach., vol. 28, pp. 16-24, Jan. 1981.
9. S. Bunton, "On-line stochastic processes in data compression," Ph.D. dissertation, Univ. Washington, Seattle, WA, 1996.
10. _, "Semanticdlly motivated improvements for PPM variants," Comput. J., vol. 40, no. 2/3, pp. 76-93, 1997.
11. N. J. Larsson, "Structures of string matching and data compression," Ph.D. dissertation, Lund Univ., Lund, Sweden, 1999.
12. M. Burrows and D. J. Wheeler, "A block-sorung lossless data compression algorithm," Digital Systems Research Center, Palo Alto, CA, Tech. Rep. SRC 124, May 1994.
13. [ 13J Z. Arnavut and S. S. Maglivcras, "Lexical permutation sorting algorithm," Comput. J., vol. 40, no. 5, pp. 292-295, 1997.
14. N. .1. Larsson, "The context trees of block sorting compression," in Proc. Data Compression Conf. Snowbird, UT: IEEE, Mar. 1998, pp. 189-198.
15. M. Effros, "Universal lossless source coding with the Burrows Wheeler transform," in Proc. Data Compression Conf. Snowbird, UT: IEEE, Mar. 1999, pp. 178-187.
16. _, "Universal lossless source coding with the Burrows Wheeler transform," IEEE Trans. Inform. Theory. June 1999, submitted for publication.
17. _, "Theory meets practice: Universal source coding with the Burrows Wheeler transform," in Proc. Allerton Conf. Communication, Control, and Computing. Monticello, IL: IEEE, Sept. 1999.
18. _, "PPM performance with BWT complexity: A new algorithm for lossless data compression," in Proc. Data Compression. Conf., Snowbird, UT, Mar. 2000.
19. E. M. McCreight, "A space-economical suffix tree construction algorithm," J ACM, vol. 23, pp. 262-272, Apr. 1976.
20. F. Jelinek, "Buffer overflow in variable length coding of fixed rate sources," JEF.F. Trans. Inform. Theory, vol. 14, pp. 490-501, May 1968.
21. A. Moffai, "Implementating the PPM data compression scheme," IEEE Trans. Commun., vol. 38, pp. 1917-1921 Nov. 1990.
22. E. Ukkonen, "On-line construction of suffix trees," Algorithmica, vol. 14, no. 3, pp. 249-260, 1995.