Most Burrows-Wheeler Based Compressors Are Not Optimal

DOI10.1007/978-3-540-73437-6_13MaRDI QIDQ3506913zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Elad Verbin

Publication date 17 June 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-73437-6_13

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1305460
• A simpler analysis of Burrows-Wheeler-based compression
• A Simpler Analysis of Burrows-Wheeler Based Compression
• An analysis of the Burrows-Wheeler transform
• Universal lossless source coding with the Burrows Wheeler transform

Cited in

(9)

• A new class of string transformations for compressed text indexing
• Balancing and clustering of words in the Burrows-Wheeler transform
• The Burrows-Wheeler transform between data compression and combinatorics on words
• When a dollar makes a BWT
• The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
• Move-to-front, distance coding, and inversion frequencies revisited
• A simpler analysis of Burrows-Wheeler-based compression
• A Simpler Analysis of Burrows-Wheeler Based Compression
• Measuring the clustering effect of BWT via RLE

This page was built for publication: Most Burrows-Wheeler Based Compressors Are Not Optimal

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