Second step algorithms in the Burrows-Wheeler compression algorithm

Software - Practice and Experience

Volumn 32, Issue 2, 2002, Pages 99-111

  Deorowicz, Sebastian ^a  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Block sorting; Burrows Wheeler transform; Calgary corpus; Data compression; List update problem; Lossless compression

Indexed keywords

COMPUTER SIMULATION; DATA COMPRESSION; DATA STRUCTURES; ENCODING (SYMBOLS); MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; SORTING;

BLOCK SORTING; BURROW WHEELER TRANSFORM; CALGARY CORPUS; LIST UPDATE PROBLEM; LOSSLESS COMPRESSION; MOVE TO FRONT TRANSFORM; RUN LENGTH ENCODING; SECOND STEP ALGORITHMS; WEIGHTED FREQUENCY COUNT;

ALGORITHMS;

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

References (30)

1. A block-sorting lossless data compression algorithm
2. Improvements to Burrows-Wheeler compression algorithm
3. A universal finite memory source
4. Universal data compression based on the Burrows-Wheeler transformation: Theory and practice
5. The context trees of block sorting compression
6. One attempt of a compression algorithm using the BWT
7. On serial files with relocatable records
8. Online list accessing algorithms and their applications: Recent empirical evidence
9. A locally adaptive data compression scheme
10. Block sorting text compression-final report
11. The Burrows-Wheeler transform for block sorting text compression: Principles and improvements
12. A fast block-sorting algorithm for lossless data compression
13. Modifications of the Burrows and Wheeler data compression algorithm
14. Improved randomized on-line algorithms for the list update problem
15. Average case analyses of list update algorithms, with applications to data compression
16. Block sorting and compression
17. Distance coder
18. Interval and recency rank source coding: Two on-line adaptive variable length schemes
19. Adaptive Suchverfahren (in German)
20. The DC program
21. Universal codeword sets and representations of the integers
22. A universal algorithm for sequential data compression
23. Semantically motivated improvements for PPM variants
24. The context tree weighting method: Basic properties
25. Switching between two universal source coding algorithms
26. The switching method: Elaborations
27. Data compression using adaptive coding and partial string matching