Publication:4791703
From MaRDI portal
DOI<1465::AID-SPE345>3.0.CO;2-D 10.1002/1097-024X(20001110)30:13<1465::AID-SPE345>3.0.CO;2-DzbMath1060.68595MaRDI QIDQ4791703
Publication date: 2000
data compression; lossless compression; Burrows-Wheeler transform; block-sorting; Calgary corpus; Canterbury corpus
68W05: Nonnumerical algorithms
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
Investigation of block-sorting of multiset permutations, Context exhumation after the Burrows-Wheeler transform, Second step algorithms in the Burrows-Wheeler compression algorithm, The Vcodex Platform for Data Compression
Cites Work
- Average case analyses of list update algorithms, with applications to data compression
- On-line construction of suffix trees
- Suffix Arrays: A New Method for On-Line String Searches
- A locally adaptive data compression scheme
- The performance of universal encoding
- A Space-Economical Suffix Tree Construction Algorithm
- The context-tree weighting method: basic properties
- Unnamed Item
- Unnamed Item