A locally adaptive data compression scheme
From MaRDI portal
Cited in
(37)- Context exhumation after the Burrows-Wheeler transform
- Using information theory approach to randomness testing
- A competitive analysis of the list update problem with lookahead
- On updating suffix tree labels
- Randomized competitive algorithms for the list update problem
- Measuring the clustering effect of BWT via RLE
- On some statistical properties of the ``Book Stack transformation
- An exact formula for the move-to-front rule for self-organizing lists
- Time-universal data compression
- A novel legitimacy preserving data hiding scheme based on LAS compressed code of VQ index tables
- Asymptotically most powerful tests for random number generators
- Weighted forward looking adaptive coding
- Paid exchanges are worth the price
- Efficient chain code compression with interpolative coding
- Parameterized analysis of paging and list update algorithms
- Burrows-Wheeler compression: Principles and reflections
- A simpler analysis of Burrows-Wheeler-based compression
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
- Compressing table data with column dependency
- Can Burrows-Wheeler transform be replaced in chain code compression?
- On list update with locality of reference
- Second step algorithms in the Burrows-Wheeler compression algorithm
- A Survey of Algorithms and Models for List Update
- Revisiting the COUNTER algorithms for list update
- The Vcodex Platform for Data Compression
- Some Results for Elementary Operations
- List update with probabilistic locality of reference
- Investigation of block-sorting of multiset permutations
- scientific article; zbMATH DE number 1862357 (Why is no real title available?)
- Balancing and clustering of words in the Burrows-Wheeler transform
- An experimental study of a compressed index
- Optimal encoding of non-stationary sources
- On optimally partitioning a text to improve its compression
- Lossless image compression using list update algorithms
- Practical and flexible pattern matching over Ziv-Lempel compressed text.
- Dynamic asymmetric communication
- Move-to-front, distance coding, and inversion frequencies revisited
This page was built for publication: A locally adaptive data compression scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3794067)
