MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Second step algorithms in the Burrows-Wheeler compression algorithm (2001) [18 citations — 0 self]

by Sebastian Deorowicz
Software Practice and Experience
Add To MetaCart

Abstract:

In this paper we fix our attention on the second step algorithms of the Burrows--Wheeler compression algorithm, which in the original version is the Move To Front transform. We discuss many of its replacements presented so far, and compare compression results obtained using them. Then we propose a new algorithm that yields a better compression ratio than the previous ones.

Citations

799 A universal algorithm for sequential data compression – Ziv, Lempel - 1977
340 A block sorting lossless data compression algorithm – Burrows, Wheeler - 1994
229 Universal codeword sets and representation of the integers – Elias - 1975
33 Improved randomized on-line algorithms for the list update problem – Albers - 1998
29 Interval and recency rank source coding: two on-line adaptive variable-length schemes – Elias - 1987
27 On serial files with relocatable records – McCabe - 1965
24 The Burrows-Wheeler transform for block sorting text compression: principles and improvements – Fenwick - 1996
24 A fast block-sorting algorithm for lossless data compression – Schindler - 1997
21 Semantically motivated improvements for PPM variants – Bunton - 1997
17 Mitzenmacher: “Average case analyses of list update algorithms, with applications to data compression”, Algorithmica vol – Albers, M - 1998
8 Improvements to Burrows-Wheeler Compression Algorithm – DEOROWICZ - 2000
7 Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice – BALKENHOL, KURTZ - 2000
6 Online List Accessing Algorithms and Their Applications: Recent Empirical Evidence – Bachrach, El-Yaniv - 1997
5 sorting text compression — final report – Block - 1996
3 Text Compression – TC, JG, et al. - 1990
3 Magliveras SS. Block Sorting and Compression – Arnavut - 1997
3 Usenet group: comp.compression – coder - 2000
3 The PPMD+ program. http://www.cs.waikato.ac.nz/~wjt/software/ppm.tar.gz – Teahan - 1996
2 A Universal Finite Memory Source – MJ, Rissanen, et al. - 1995
2 Sleator DD, Tarjan RE, Wei VK. A Locally Adaptive Data Compression Scheme – JL - 1986
2 Adaptive Suchverfahren (in German). Doctoral dissertation, der Technischen Fakultat der Universitat des Saarlandes – Schulz - 1999
2 The DC program – Binder - 2000
2 Shtarkov YM, Tjalkens TJ. The Context Tree Weighting Method: Basic Properties – FMJ - 1995
2 Switching between two universal source coding algorithms – PAJ, FMJ - 1998
2 The switching method: elaborations – PAJ, FMJ
1 The Context Trees of Block Sorting Compression – NJ - 1998
1 Shtarkov YM. One attempt of a compression algorithm using the BWT – Balkenhol - 1999
1 Shtarkov YM. Modifications of the Burrows and Wheeler Data Compression Algorithm – Balkenhol, Kurtz - 1999
1 Private communications – Binder - 2001
View or Download | Add to My Collection | Correct Errors