A simpler analysis of Burrows–Wheeler-based compression |
| |
Authors: | Haim Kaplan Shir Landau Elad Verbin |
| |
Affiliation: | School of Computer Science, Tel Aviv University, Tel Aviv, Israel |
| |
Abstract: | In this paper, we present a new technique for worst-case analysis of compression algorithms which are based on the Burrows–Wheeler Transform. We mainly deal with the algorithm proposed by Burrows and Wheeler in their first paper on the subject M. Burrows, D.J. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, Palo Alto, California, 1994], called bw0. This algorithm consists of the following three essential steps: (1) Obtain the Burrows–Wheeler Transform of the text, (2) Convert the transform into a sequence of integers using the move-to-front algorithm, (3) Encode the integers using Arithmetic code or any order-0 encoding (possibly with run-length encoding). |
| |
Keywords: | Text compression Burrows&ndash Wheeler Transform Distance coding Worst-case analysis |
本文献已被 ScienceDirect 等数据库收录! |
|