High-performance BWT-based Encoders
数据结构与算法
2007-05-23 v1
摘要
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].
引用
@article{arxiv.cs/0508086,
title = {High-performance BWT-based Encoders},
author = {Dragos Trinca},
journal= {arXiv preprint arXiv:cs/0508086},
year = {2007}
}
备注
12 pages