Burrows-Wheeler compression with variable length integer codes

Software - Practice and Experience

Volumn 32, Issue 13, 2002, Pages 1307-1316

  Wainer, Gabriel ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Burrows Wheeler compression; Elias codes; Fibonacci codes; Fraenkel Klein codes; Universal codes

Indexed keywords

ALGORITHMS; DATA COMPRESSION; DIGITAL ARITHMETIC; ENCODING (SYMBOLS);

ARITHMETIC CODERS;

BLOCK CODES;

EID: 0037058241     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.484     Document Type: Article

References (16)

1. Burrows M., Wheeler D.J. A block-sorting lossless data compression algorithm. SRC Research Report 124, Digital Systems Research Center, Palo Alto, 1994. gatekeeper.dec.com/pub/DEC/SRC/research-reports/SRC-124.ps.Z.
2. Fenwick P.M. The Burrows-Wheeler transform for block sorting text compression-principles and improvements. The Computer Journal 1996; 39(9):731-740.
3. Fenwick P.M. Experiments with a block sorting text compression algorithm. Report No. 111, Department of Computer Science, The University of Auckland, May 1995.
4. Fenwick P.M. Improvements to the block sorting text compression algorithm. Department of Computer Science, The University of Auckland, Report No. 120, August 1995.
5. Fenwick P.M. Block sorting text compression-final report. Report No. 130, Department of Computer Science, The University of Auckland, April 1996.
6. Fenwick P.M. Block sorting text compression. ACSC-96, Proceedings of the 19th Australasian Computer Science Conference, Melbourne, January 1996; 193-202.
7. Balkenhol B., Kurtz S., Shtarkov Y.M. Modifications of the Burrows and Wheeler data compression algorithm Proceedings IEEE Data Compression Conference, March 1999. IEEE Computer Society Press: Los Alamitos, CA, 1999; 188-197.
8. Deorowicz S. Improvements to Burrows-Wheeler compression algorithm. Software: Practice and Experience 2000; 30(13):1465-1483.
9. Seward J. Private Communication. For notes on the released BZIP see http://hpux.cae.wisc.edu/man/Sysadmin/bzip-0.21.
10. Wirth A.I., Moffat A. Can we do without ranks in Burrows-Wheeler Transform compression? Proceedings IEEE Data Compression Conference, March 2001. IEEE Computer Society Press: Los Alamitos, CA, 2001; 419-428.
11. Arnavut A. Generalization of the BWT transformation and inversion ranks. Proceedings IEEE Data Compression Conference, March 2002. IEEE Computer Society Press: Los Alamitos, CA, 2002; 477-486.
12. Balkenhol B., Shtarkov Y.M. One attempt of a compression algorithm using BWT. www.mathematik.uni-bielefeld.de/sfb343/preprints/pr99133.ps.gz.
13. Deorowicz S. Second step algorithms in the Burrows-Wheeler compression algorithm. Software: Practice and Experience 2002; 32(2):99-111.
14. Elias P. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 1975; 21(2): 194-203.
15. Zeckendorf E. Représentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas. Bulletin de la Societe Royale des Sciences de Liege 1972; 41:179-182.
16. Fraenkel A.S., Klein S.T. Robust universal complete codes for transmission and compression. Discrete Applied Mathematics 1996; 64:31-55.