Burrows–Wheeler compression with variable length integer codes
Author:
- 19 September 2002
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 32 (13) , 1307-1316
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Second step algorithms in the Burrows–Wheeler compression algorithmSoftware: Practice and Experience, 2001
- Improvements to Burrows-Wheeler compression algorithmSoftware: Practice and Experience, 2000
- The Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and ImprovementsThe Computer Journal, 1996
- Robust universal complete codes for transmission and compressionDiscrete Applied Mathematics, 1996
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975