Second step algorithms in the Burrows-Wheeler compression algorithm

DOI10.1002/spe.426zbMath0987.68789OpenAlexW2156630914MaRDI QIDQ2783312

Sebastian Deorowicz

Publication date: 15 April 2002

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.426

zbMATH Keywords

Burrows-Wheeler compression

Mathematics Subject Classification ID

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

Related Items (5)

Burrows-Wheeler compression: Principles and reflections ⋮ A simpler analysis of Burrows-Wheeler-based compression ⋮ Investigation of block-sorting of multiset permutations ⋮ Move-to-front, distance coding, and inversion frequencies revisited ⋮ Context exhumation after the Burrows-Wheeler transform

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average case analyses of list update algorithms, with applications to data compression
• Universal data compression based on the Burrows-Wheeler transformation: theory and practice
• Interval and recency rank source coding: Two on-line adaptive variable-length schemes
• A locally adaptive data compression scheme
• Universal codeword sets and representations of the integers
• A universal algorithm for sequential data compression
• A universal finite memory source
• The context-tree weighting method: basic properties
• On Serial Files with Relocatable Records

This page was built for publication: Second step algorithms in the Burrows-Wheeler compression algorithm