Second step algorithms in the Burrows-Wheeler compression algorithm

DOI10.1002/SPE.426MaRDI QIDQ2783312zbMATH OpenOpenAlexFDO

Authors Sebastian Deorowicz

Publication date 15 April 2002

Published in Software. Practice \& 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

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

Recommendations

• scientific article; zbMATH DE number 1862357
• scientific article; zbMATH DE number 1305460
• Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
• An analysis of the Burrows-Wheeler transform
• A simpler analysis of Burrows-Wheeler-based compression

Cites work

• A locally adaptive data compression scheme
• A universal algorithm for sequential data compression
• A universal finite memory source
• Average case analyses of list update algorithms, with applications to data compression
• scientific article; zbMATH DE number 1862357 (Why is no real title available?)
• scientific article; zbMATH DE number 910898 (Why is no real title available?)
• scientific article; zbMATH DE number 6472578 (Why is no real title available?)
• Interval and recency rank source coding: Two on-line adaptive variable-length schemes
• On Serial Files with Relocatable Records
• The context-tree weighting method: basic properties
• Universal codeword sets and representations of the integers
• Universal data compression based on the Burrows-Wheeler transformation: theory and practice

Cited in

(7)

• Context exhumation after the Burrows-Wheeler transform
• Burrows-Wheeler compression: Principles and reflections
• A simpler analysis of Burrows-Wheeler-based compression
• Investigation of block-sorting of multiset permutations
• scientific article; zbMATH DE number 1862357 (Why is no real title available?)
• The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
• Move-to-front, distance coding, and inversion frequencies revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2783312)