High-performance BWT-based Encoders

Details High-performance BWT-based Encoders High-performance BWT-based Encoders

2005-08-21

arxiv.org/abs/cs/0508086v1

Computer Science

Data Structures and Algorithms

12 pages

Scientific paper

In 1994, Burrows and Wheeler developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in order to improve their algorithm, which is based on a reversible transformation of the input string, called BWT (the Burrows-Wheeler transformation). In this paper, we propose a compression scheme based on BWT, MTF (move-to-front coding), and a version of the algorithms presented in [Dragos Trinca, ITCC-2004].

Affiliated with

Also associated with

No associations

Rating

High-performance BWT-based Encoders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with High-performance BWT-based Encoders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-performance BWT-based Encoders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33475