Burrows-Wheeler compression: Principles and reflections

DOI10.1016/j.tcs.2007.07.012zbMath1144.68018MaRDI QIDQ2465053

Peter Fenwick

Publication date: 19 December 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.012

zbMATH Keywords

Burrows-Wheeler transform; erasure channels; PPM; recovered contexts; run encoding

Mathematics Subject Classification ID

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

Related Items

On Undetected Redundancy in the Burrows-Wheeler Transform, Context exhumation after the Burrows-Wheeler transform

Cites Work

• Unnamed Item
• Unnamed Item
• Context exhumation after the Burrows-Wheeler transform
• Second step algorithms in the Burrows-Wheeler compression algorithm
• Universal data compression based on the Burrows-Wheeler transformation: theory and practice
• The Myriad Virtues of Wavelet Trees
• Prediction and Entropy of Printed English
• A locally adaptive data compression scheme
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Burrows-Wheeler compression with variable length integer codes
• The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression