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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 387; H. 3; S. 220 - 235
Hauptverfasser:	Kaplan, Haim, Landau, Shir, Verbin, Elad
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 22.11.2007
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!