Sciweavers

5 search results - page 1 / 1
» Compression boosting in optimal linear time using the Burrow...
Sort
View
CORR
2012
Springer
220views Education» more  CORR 2012»
12 years 29 days ago
A Bijective String Sorting Transform
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 compressio...
Joseph Yossi Gil, David Allen Scott
VLDB
2007
ACM
117views Database» more  VLDB 2007»
14 years 5 months ago
RadixZip: Linear-Time Compression of Token Streams
RadixZip is a block compression technique for token streams. It introduces RadixZip Transform, a linear time algorithm that rearranges bytes using a technique inspired by radix so...
Binh Vo, Gurmeet Singh Manku
CPM
2007
Springer
73views Combinatorics» more  CPM 2007»
13 years 9 months ago
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
Move-to-Front, Distance Coding and Inversion Frequencies are three simple and effective techniques used to process the output of the Burrows-Wheeler Transform. In this paper we pr...
Travis Gagie, Giovanni Manzini
AAIM
2006
Springer
143views Algorithms» more  AAIM 2006»
13 years 11 months ago
A Compression-Boosting Transform for Two-Dimensional Data
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
Qiaofeng Yang, Stefano Lonardi, Avraham Melkman