Higher Compression from the Burrows-Wheeler Transform with New Algorithms for the List Update Problem
Description:
Burrows-Wheeler compression is a three stage process in which the data is transformed with the Burrows-Wheeler Transform, then transformed with Move-To-Front, and finally encoded with an entropy coder. Move-To-Front, Transpose, and Frequency Count are some of the many algorithms used on the List Update problem. In 1985, Competitive Analysis first showed the superiority of Move-To-Front over Transpose and Frequency Count for the List Update problem with arbitrary data. Earlier studies due to Bit…
more
Date:
August 2001
Creator:
Chapin, Brenton
Partner:
UNT Libraries