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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 387; číslo 3; s. 220 - 235
Hlavní autori:	Kaplan, Haim, Landau, Shir, Verbin, Elad
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 22.11.2007
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!