Most Burrows-Wheeler Based Compressors Are Not Optimal

DOI10.1007/978-3-540-73437-6_13zbMath1138.68416OpenAlexW1596069658MaRDI QIDQ3506913

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)

Related Items (6)

The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ Measuring the clustering effect of BWT via RLE ⋮ A new class of string transformations for compressed text indexing ⋮ When a dollar makes a BWT ⋮ Balancing and clustering of words in the Burrows-Wheeler transform ⋮ Move-to-front, distance coding, and inversion frequencies revisited

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