Amortized efficiency of list update and paging rules
Communications of the ACM
A locally adaptive data compression scheme
Communications of the ACM
Interval and recency rank source coding: two on-line adaptive variable-length schemes
IEEE Transactions on Information Theory
Improved Randomized On-Line Algorithms for the List Update Problem
SIAM Journal on Computing
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On self-organizing sequential search heuristics
Communications of the ACM
Universal Lossless Source Coding with the Burrows Wheeler Transform
DCC '99 Proceedings of the Conference on Data Compression
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 Proceedings of the Conference on Data Compression
Switching Between Two Universal Source Coding Algorithms
DCC '98 Proceedings of the Conference on Data Compression
Higher Compression from the Burrows-Wheeler Transform by Modified Sorting
DCC '98 Proceedings of the Conference on Data Compression
Coding for a binary independent piecewise-identically-distributed source
IEEE Transactions on Information Theory - Part 2
Enhanced word-based block-sorting text compression
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Parsing Strategies for BWT Compression
DCC '01 Proceedings of the Data Compression Conference
Can We Do without Ranks in Burrows Wheeler Transform Compression?
DCC '01 Proceedings of the Data Compression Conference
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
An Application of Self-organizing Data Structures to Compression
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
| Hi-index | 0.00 |
Encoding data by switching between two universal data compression algorithms achieves higher rates of compression than either algorithm alone. Applied with two list updating algorithms, the technique yields higher compression of piecewise independent identically distributed (p.i.i.d.) data, such as the output of the Burrows-Wheeler transform.Introduced within is a new class of such algorithms, the Best x of 2x-1. When paired with variants of the Move-To-Front algorithm in a switching scheme, the Best x of 2x-1 algorithms achieve higher compression of p.i.i.d. data.