Robust universal complete codes for transmission and compression
Discrete Applied Mathematics
Second step algorithms in the Burrows-Wheeler compression algorithm
Software—Practice & Experience
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 Proceedings of the Conference on Data Compression
Generalization of the BWT Transformation and Inversion Ranks
DCC '02 Proceedings of the Data Compression Conference
Can We Do without Ranks in Burrows Wheeler Transform Compression?
DCC '01 Proceedings of the Data Compression Conference
Binary codes for locally homogeneous sequences
Information Processing Letters
When indexing equals compression: Experiments with compressing suffix arrays and applications
ACM Transactions on Algorithms (TALG)
Burrows–Wheeler compression: Principles and reflections
Theoretical Computer Science
Move-to-Front, Distance Coding, and Inversion Frequencies revisited
Theoretical Computer Science
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
Move-to-front, distance coding, and inversion frequencies revisited
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Re-Ordered FEGC and Block Based FEGC for Inverted File Compression
International Journal of Information Retrieval Research
| Hi-index | 0.00 |
The final coder in Burrows-Wheeler compression is usually either an adaptive Huffman coder (for speed) or a complex of arithmetic coders for better compression. This article describes the use of conventional pre-defined variable length codes or universal codes and shows that they too can give excellent compression. The paper also describes a 'sticky Move-to-Front' modification which gives a useful improvement in compression for most files.