A simpler analysis of Burrows-Wheeler-based compression

Theoretical Computer Science

Volumn 387, Issue 3, 2007, Pages 220-235

  Kaplan, Haim ^a   Landau, Shir ^a   Verbin, Elad ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Burrows Wheeler Transform; Distance coding; Text compression; Worst case analysis

Indexed keywords

ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; SORTING;

BURROWS-WHEELER TRANSFORM; DISTANCE CODING; TEXT COMPRESSION; WORST-CASE ANALYSIS;

DATA COMPRESSION;

EID: 35449007257     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.07.020     Document Type: Article

References (26)

1. The Canterbury Corpus. http://corpus.canterbury.ac.nz
2. Abel J. Web page about distance coding. http://www.data-compression.info/Algorithms/DC/
3. Apostolico A., and Fraenkel A.S. Robust transmission of unbounded strings using Fibonacci representations. IEEE Transactions on Information Theory 33 2 (1987) 238-245
4. Bentley J.L., Sleator D.D., Tarjan R.E., and Wei V.K. A locally adaptive data compression scheme. Communications of the ACM 29 4 (1986) 320-330
5. E. Binder, Distance coder, Usenet group comp.compression, 2000
6. M. Burrows, D.J. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, Palo Alto, California, 1994
7. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press, McGraw-Hill pp. 385-392 (Chapter 16.3)
8. Deorowicz S. Second step algorithms in the Burrows-Wheeler compression algorithm. Software - Practice and Experience 32 2 (2002) 99-111
9. Elias P. Universal codeword sets and representation of the integers. IEEE Transactions on Information Theory 21 2 (1975) 194-203
10. Fenwick P. Universal codes. In: Sayood K. (Ed). Lossless Data Compression Handbook (2003), Academic Press
11. P. Ferragina, R. Giancarlo, G. Manzini, The engineering of a compression boosting library: Theory vs practice in BWT compression, Technical Report TR-INF-2006-06-03-UNIPMN, Universitá degli Studi del Piemonte Orientale, June 2006
12. P. Ferragina, R. Giancarlo, G. Manzini, The engineering of a compression boosting library: Theory vs practice in BWT compression, in: Proc. 14th European Symposium on Algorithms, ESA '06, 2006, pp. 756-767
13. Ferragina P., Giancarlo R., Manzini G., and Sciortino M. Boosting textual compression in optimal linear time. Journal of the ACM 52 (2005) 688-713
14. Ferragina P., and Manzini G. Indexing compressed text. Journal of the ACM 52 (2005) 552-581
15. P. Ferragina, G. Manzini, V. Mākinen, G. Navarro, An alphabet friendly FM-index, in: Proc. 11th Symposium on String Processing and Information Retrieval, SPIRE '04, 2004, pp. 150-160
16. Fraenkel A.S., and Klein S.T. Robust universal complete codes for transmission and compression. Discrete Applied Mathematics 64 1 (1996) 31-55
17. R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in: Proc. 14th ACM-SIAM Symposium on Discrete algorithms, SODA '03, 2003, pp. 841-850
18. R. Grossi, A. Gupta, J.S. Vitter, When indexing equals compression: Experiments with compressing suffix arrays and applications, in: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms, SODA '04, 2004, pp. 636-645
19. Huffman D.A. A method for the construction of minimum-redundancy codes. Proceedings of the Institute of Radio Engineers 40 9 (1952) 1098-1101
20. Lelewer D.A., and Hirschberg D.S. Data compression. ACM Computing Surveys 19 3 (1987) 261-296
21. Manzini G. An analysis of the Burrows-Wheeler transform. Journal of the ACM 48 3 (2001) 407-430
22. Manzini G., and Ferragina P. Engineering a lightweight suffix array construction algorithm. Algorithmica 40 (2004) 33-50
23. Moffat A., Neal R.M., and Witten I.H. Arithmetic coding revisited. ACM Transactions on Information Systems 16 3 (1998) 256-294
24. R. Raman, V. Raman, S.S. Rao, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, SODA '02, 2002, pp. 233-242
25. Seward J. bzip2, a program and library for data compression. http://www.bzip.org/
26. Witten I.H., Neal R.M., and Cleary J.G. Arithmetic coding for data compression. Communications of the ACM 30 6 (1987) 520-540