A Bijective String Sorting Transform

Details A Bijective String Sorting Transform A Bijective String Sorting Transform

2012-01-15

arxiv.org/abs/1201.3077v1

Computer Science

Data Structures and Algorithms

Scientific paper

Given a string of characters, the Burrows-Wheeler Transform rearranges the characters in it so as to produce another string of the same length which is more amenable to compression techniques such as move to front, run-length encoding, and entropy encoders. We present a variant of the transform which gives rise to similar or better compression value, but, unlike the original, the transform we present is bijective, in that the inverse transformation exists for all strings. Our experiments indicate that using our variant of the transform gives rise to better compression ratio than the original Burrows-Wheeler transform. We also show that both the transform and its inverse can be computed in linear time and consuming linear storage.

Affiliated with

Also associated with

No associations

Rating

A Bijective String Sorting Transform 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 A Bijective String Sorting Transform, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Bijective String Sorting Transform will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-159211