Improvements to Burrows-Wheeler compression algorithm

Software - Practice and Experience

Volumn 30, Issue 13, 2000, Pages 1465-1483

  Deorowicz, Sebastian ^a  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; MATHEMATICAL TRANSFORMATIONS; SORTING;

BLOCK SORTING; BURROWS-WHEELER COMPRESSION ALGORITHM; LOSSLESS COMPRESSION;

DATA COMPRESSION;

EID: 0034324241     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-024X(20001110)30:13<1465::AID-SPE345>3.0.CO;2-D     Document Type: Article

References (32)

1. Burrows M, Wheeler DJ. A block-sorting lossless data compression algorithm. SRC Research Report 124, Digital Equipment Corporation, 1994. ftp://ftp.digital.com/pub/DEC/SRC/research-reports/SRC-124.ps.zip.
2. Bentley JL, Sleator DD, Tarjan RE, Wei VK. A locally adaptive data compression scheme. Communications of the ACM 1986; 29(4):320-330.
3. Balkenhol B, Kurtz S. Universal data compression based on the Burrows and Wheeler Transformation theory and practice. Technical Report 98-069, Sonderforschungsbereich: Diskrete Strukturen in der Mathematic, Universitat Bielefeld, 1998. http://www.mathematik.uni-bielefeld.de/sfb343/preprints.
4. Arimura M, Yamamoto H. Asymptotic optimally of the block sorting data compression algorithm. IEICE Transactions on Fundamentals 1998; E81-A(10):2117-2122.
5. Arnavut A, Magliveras SS. Block sorting and compression. Proceedings of the IEEE Data Compression Conference, 1997; 181-190. http://helios.unl.edu/~spyros/dcc_v5.ps.
6. Effros M. Universal lossless source coding with the Burrows Wheeler Transform. Proceedings of the Data Compression Conference, 1999; 178-187.
7. McCreight EM. A space-economical suffix tree construction algorithm. Journal of the ACM 1976; 23(2):262-272.
8. Ukkonen E. On-line construction of suffix trees. Algorithmica 1995; 14(3):249-260.
9. Balkenhol B, Kurtz S, Shtarkov YM. Modifications of the Burrows and Wheeler data compression algorithm. Proceedings of the IEEE Data Compression Conference, 1999; 188-197. http://www.mathematik.unibielefeld.de/ahlswede/pub/balkenhol/dcc99.ps.gz.
10. Kurtz S. Reducing the space requirement of suffix trees. Software-Practice and Experience 1999; 29(13):1149-1171.
11. Manber U, Myers EW. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 1993; 22(5):935-948.
12. Bentley JL, Sedgewick R. Fast algorithms for sorting and searching strings. Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 1997; 360-369.
13. Larsson NJ. Structures of string matching and data compression. Doctoral dissertation, Department of Computer Science, Lund University, Sweden, September 1999. http://www.cs.lth.se/~jesper/thesis.pdf.
14. Chapin B, Tate SR. Higher compression from the Burrows-Wheeler Transform by modified sorting. Proceedings of the IEEE Data Compression Conference, 1998; 532. http://www.cs.unt.edu/~srt/papers/bwtsort.ps.
15. Fenwick P. Block sorting text compression. Proceedings of the 19th Australian Computer Science Conference, Melbourne, Australia, 1996; 193-202. ftp://ftp.cs.auckland.ac.nz/out/peter-f/ACSC96paper.ps.
16. Fenwick P. Block sorting text compression - final report. Technical Report 130, The University of Auckland, Department of Computer Science, 1996. ftp://ftp.cs.auckland.ac.nz/pub/peter-f/TechRep130.ps.
17. Schindler M. A fast block-sorting algorithm for lossless data compression. Proceedings of the IEEE Data Compression Conference, 1997; 469. http://www.apm.tuwien.ac.at/~michael/papers/dcc97prc.ps.
18. Albers S. Improved randomized on-line algorithms for the list update problem. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, 1995; 412-419.
19. Albers S, Mitzenmacher M. Average case analysis of list update algorithms, with applications to data compression. Algorithmica 1998; 21(3):312-329.
20. Bell TC, Cleary JG, Witten IH. Text Compression. Prentice Hall: Englewood Cliffs, NJ, 1990.
21. Krichevsky RE, Trofimov VK. The performance of universal encoding. IEEE Transactions on Information Theory 1981; 27:199-207.
22. Moffat A, Neal RM, Witten IH. Arithmetic coding revisited. ACM Transactions on Information Systems 1998; 16(3):256-294.
23. Fenwick P. The Burrows-Wheeler Transform for block sorting text compression: principles and improvements. The Computer Journal 1996; 39(9):731-740.
24. Cleary JG, Teahan WJ, Witten IH. Unbounded length context for PPM. Proceedings of the IEEE Data Compression Conference, 1995; 52-61. http://www.cs.waikato.ac.nz/~wjt/papers/DCC95a.ps.gz.
25. Bunton S. Semantically motivated improvements for PPM variants. The Computer Journal 1997; 40(2/3):76-93.
26. Willems FMJ, Shtarkov YM, Tjalkens TJ. The context tree weighting method: basic properties. IEEE Transactions on Information Theory 1995; 41:653-664. http://ei1.ei.ele.tue.nl/~frans/ctw1.ps.
27. Volf PAJ, Willems FMJ. Switching between two universal source coding algorithms. Proceedings of the IEEE Data Compression Conference, 1998; 491-500. http://ei1.ei.ele.tue.nl/~paul/p_and_w/dcc98.zip.
28. Volf PAJ, Willems FMJ. The switching method: elaborations. Proceedings of the 19th Symposium on Information Theory in the Benelux, 1998; 13-20. http://ei1.ei.ele.tue.nl/~paul/p_and_w/ben98.ps.zip.
29. Arnold R, Bell T. A corpus for the evaluation of lossless compression algorithms. Proceedings of the IEEE Data Compression Conference, 1997; 201-210. http://corpus.canterbury.ac.nz//report.ps.gz.
30. Teahan B. The PPMD+ program. http://www.cs.waikato.ac.nz/~wjt/software/ppm.tar.gz [1996].
31. Wheeler D. The bred3 program. ftp://ftp.cl.cam.ac.uk/users/djw3 [1997].
32. Seward J. The bzip0.21 program. http://www.muraroa.demon.co.uk [1997].