Burrows-Wheeler compression with variable length integer codes

The final coder in Burrows–Wheeler compression is usually either an adaptive Huffman coder (for speed) or a complex of arithmetic coders for better compression. This article describes the use of conventional pre‐defined variable length codes or universal codes and shows that they too can give excell...

Full description

Saved in:
Bibliographic Details
Published inSoftware, practice & experience Vol. 32; no. 13; pp. 1307 - 1316
Main Author Fenwick, Peter
Format Journal Article
LanguageEnglish
Published Chichester, UK John Wiley & Sons, Ltd 01.11.2002
Subjects
Burrows-Wheeler compression
Elias γ codes
Fibonacci codes
Fraenkel-Klein codes
universal codes
Online AccessGet full text
ISSN0038-0644
1097-024X
DOI10.1002/spe.484

Cover

More Information
Summary:The final coder in Burrows–Wheeler compression is usually either an adaptive Huffman coder (for speed) or a complex of arithmetic coders for better compression. This article describes the use of conventional pre‐defined variable length codes or universal codes and shows that they too can give excellent compression. The paper also describes a ‘sticky Move‐to‐Front’ modification which gives a useful improvement in compression for most files. Copyright © 2002 John Wiley & Sons, Ltd.
Bibliography:ark:/67375/WNG-P0L27WFL-Z
istex:E778D5B8FF7A0A0A2ADB3112EB93BD4287758DFE
ArticleID:SPE484
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0038-0644
1097-024X
DOI:10.1002/spe.484