High-performance BWT-based Encoders
Dragos Trinca
Abstract
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].
Create a lesson
Related papers
Fast FPRAS for the Permanent
Xiaoyu Chen, Heng Guo, Eric Vigoda et al.
Large-Scale Trade-Off Curve Computation for Incentive Allocation with Cardinality and Matroid Constraints
Yu Cong, Chao Xu, Yi Zhou
An Ω( n m) Information-Theoretic Lower Bound for Randomized Online Set Cover
Roie Levin
Optimal Simulated Annealing for Partition Function Estimation
Heng Guo, Hongyang Liu, Xiongxin Yang et al.
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis et al.
Exact Greedy Influence Maximization in Linear Time on Bounded-Treewidth Graphs
Matic Požar