Software Practice and Experience · 2002 · 21 citations · 11 references
EngineeringBiologyData StructuresMedical CodingSequence AnalysisCoding TheoryData CodingData CompressionError-correcting CodesUniversal CodingAdaptive CompressionBurrows-wheeler TransformCoder Performance EvaluationCompressionCompression AlgorithmsCompression TechniquesHuffman CodingVariable-length Coding
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.
11
A Block-sorting Lossless Data Compression Algorithm
Michael T. Burrows, D. J. Wheeler · 1994 · 2.4K citations
Proceedings IEEE Data Compression Conference
James A. Elliott, Peter Grant, Garrett Sexton · 1991 · 81 citations