An analysis of the second step algorithms in the Burrows-Wheeler compression algorithm
Published in Papers/Documentation, Burrows-Wheeler Transform/Block Sorting
A paper by Sebastian Deorowicz. Implementing the BWT transform is nice and simple, but what you do with the transformed data is where all the action is. Traditionally, we use Move To Front followed by an entropy encoder. Sebastian talks about some alternatives that help compression.
http://www-zo.iinf.polsl.gliwice.pl/~sdeor/pub/deo00b.ps
Posted in November 29th, 2000
No User Commented In " An analysis of the second step algorithms in the Burrows-Wheeler compression algorithm "
Subscribes to this post Comment RSS or TrackBack URL
