A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 Proceedings of the Conference on Data Compression
DCC '97 Proceedings of the Conference on Data Compression
Universal Lossless Source Coding with the Burrows Wheeler Transform
DCC '99 Proceedings of the Conference on Data Compression
Modifications of the Burrows and Wheeler Data Compression Algorithm
DCC '99 Proceedings of the Conference on Data Compression
DCC '00 Proceedings of the Conference on Data Compression
SEQUENCES '97 Proceedings of the Compression and Complexity of Sequences 1997
Switching Between Two Universal Source Coding Algorithms
DCC '98 Proceedings of the Conference on Data Compression
Enhanced word-based block-sorting text compression
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
Burrows--Wheeler compression with variable length integer codes
Software—Practice & Experience
Lossless image compression using pixel reordering
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Compression boosting in optimal linear time using the Burrows-Wheeler Transform
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Boosting textual compression in optimal linear time
Journal of the ACM (JACM)
Context exhumation after the Burrows-Wheeler transform
Information Processing Letters
When indexing equals compression: Experiments with compressing suffix arrays and applications
ACM Transactions on Algorithms (TALG)
Conjugation-based compression for Hebrew texts
ACM Transactions on Asian Language Information Processing (TALIP)
Burrows–Wheeler compression: Principles and reflections
Theoretical Computer Science
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Context exhumation after the Burrows--Wheeler transform
Information Processing Letters
Optimal partitions of strings: a new class of Burrows-Wheeler compression algorithms
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
| Hi-index | 0.00 |
Abstract: Compressors based on the Burrows Wheeler transform (BWT) convert the transformed text into a string of (move-to-front) ranks. These ranks are then encoded with an Order-0 model, or a hierarchy of such models. Although these rank-based methods perform very well, we believe the transformation to MTF numbers blurs the distinction between individual symbols and is a possible cause of inefficiency. Instead of relying on symbol ranking, we examine the problem of directly encoding the symbols in the BWT text.