A simpler analysis of Burrows–Wheeler-based compression

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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 387; no. 3; pp. 220 - 235
Main Authors:	Kaplan, Haim, Landau, Shir, Verbin, Elad
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 22.11.2007
Subjects:	Burrows–Wheeler Transform Distance coding Text compression Worst-case analysis Text compression Worst-case analysis Burrows–Wheeler Transform Distance coding
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!