A locally adaptive data compression scheme
Communications of the ACM
Interval and recency rank source coding: two on-line adaptive variable-length schemes
IEEE Transactions on Information Theory
Transformations between tree permutations and inversion tables
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Permutation Generation Methods
ACM Computing Surveys (CSUR)
A Fast Block-Sorting Algorithm for Lossless Data Compression
DCC '97 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
Word-based block-sorting text compression
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Generalization of the BWT Transformation and Inversion Ranks
DCC '02 Proceedings of the Data Compression Conference
Prototyping of Efficient Hardware Algorithms for Data Compression in Future Communication Systems
RSP '01 Proceedings of the 12th International Workshop on Rapid System Prototyping
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Burrows–Wheeler compression: Principles and reflections
Theoretical Computer Science
Evolutionary lossless compression with GP-ZIP*
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Word-based text compression using the Burrows-Wheeler transform
Information Processing and Management: an International Journal
Post BWT stages of the Burrows–Wheeler compression algorithm
Software—Practice & Experience
Evolution of human-competitive lossless compression algorithms with GP-zip2
Genetic Programming and Evolvable Machines
| Hi-index | 0.01 |
Motivated by the Move-to-Front (MTF) coder's (recency ranking) utilization of small size permutations which are restricted to the data source's alphabet size, we investigate compression of data files by using the canonical sorting permutations from the set of {0, ..., n }, where n is the size of a data source, followed by inversion coding.We show that the inversion coding (ranking) technique introduced yields better compression gain than the recency ranking (MTF coder) for almost all the test data files. Furthermore, we investigate replacement of MTF coder in the Block Sorting Schemes and show that when inversion coding is used after the BWT transformation, it yields better compression gains on average than the well-known block sorting techniques such as Bzip, Bks98 and Szip-b.