Block Sorting and Compression (1997) [10 citations — 1 self]
Abstract:
The Block Sorting Lossless Data Compression Algorithm (BSLDCA) described by Burrows and Wheeler [3] has received considerable attention. It achieves as good compression rates as context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques [5]. This paper, describes the Lexical Permutation Sorting Algorithm (LPSA), its theoretical basis, and delineates its relationship to BSLDCA. In particular we describe how BSLDCA can be reduced to LPSA and show how LPSA could give better results than BSLDCA when transmitting permutations. We also introduce a new technique, Inversion Frequencies, and show that it does as well as Move-to-Front (MTF) Coding when there is locality of reference in the data. 1 Introduction Burrows and Wheeler [3], introduced a new algorithm, which they call the Block Sorting Lossless Data Compression Algorithm (BSLDCA). When applied to text or image data their algorithm achieves better compression rates than Ziv-Lempel techniques with compa...
Citations
| 1516 | The Art of Computer Programming – Knuth - 1968 |
| 340 | A block sorting lossless data compression algorithm – Burrows, Wheeler - 1994 |
| 22 | Block sorting text compression – Fenwick - 1996 |
| 9 | Improvements to the Block Sorting Text Compression Algorithm – FENWICK - 1995 |
| 6 | Experiments with a Block-Sorting Text Compression Algorithm", The – Fenwick - 1995 |
| 2 | Applications of inversions to lossless image compression – Arnavut - 1997 |
| 1 | Applications of Permutations to Lossless Data Compression – Arnavut - 1995 |
| 1 | Block Sorting Text Compression", The – Fenwick - 1995 |
| 1 | Permutation Generation Methods: A review – Sedgewick - 1977 |

