A Simpler Analysis of Burrows-Wheeler Based Compression

DOI10.1007/11780441_26MaRDI QIDQ5307513zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Shir Landau, Elad Verbin

Publication date 14 September 2007

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780441_26

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(8)

• A simpler analysis of Burrows-Wheeler-based compression
• An analysis of the Burrows-Wheeler transform
• Most Burrows-Wheeler Based Compressors Are Not Optimal
• Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
• scientific article; zbMATH DE number 1305460 (Why is no real title available?)
• scientific article; zbMATH DE number 1862357 (Why is no real title available?)
• Nearly tight bounds on the encoding length of the Burrows-Wheeler transform
• List Update with Locality of Reference

This page was built for publication: A Simpler Analysis of Burrows-Wheeler Based Compression

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