Burrows-Wheeler compression: Principles and reflections

DOI10.1016/j.tcs.2007.07.012zbMath1144.68018OpenAlexW2090004052MaRDI 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 transformerasure channelsPPMrecovered contextsrun encoding

Mathematics Subject Classification ID

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

Related Items (2)

Context exhumation after the Burrows-Wheeler transform ⋮ On Undetected Redundancy in 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

This page was built for publication: Burrows-Wheeler compression: Principles and reflections