Context exhumation after the Burrows-Wheeler transform

DOI10.1016/j.ipl.2005.03.008zbMath1185.68323OpenAlexW2089832166MaRDI QIDQ1041774

Sebastian Deorowicz

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.03.008

zbMATH Keywords

algorithmsdata compressionBurrows-Wheeler transformprediction by partial matching

Mathematics Subject Classification ID

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

Related Items (1)

Burrows-Wheeler compression: Principles and reflections

Cites Work

• Unnamed Item
• Burrows-Wheeler compression: Principles and reflections
• Second step algorithms in the Burrows-Wheeler compression algorithm
• Universal data compression based on the Burrows-Wheeler transformation: theory and practice
• A locally adaptive data compression scheme
• The context-tree weighting method: basic properties

This page was built for publication: Context exhumation after the Burrows-Wheeler transform