Abstract

[Summary form only given]. Introduced by Bentley et al (1986), move-to-front (MTF) coding is an adaptive, self-organizing list (permutation) technique. Motivated with the MTF coder's 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 followed by permutation based inversion coding (PBIC) from the set of {0, ..., n-1}, where n is the size of the data source. The technique introduced yields better compression gain than the MTF coder and improves the compression gain in block sorting techniques.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call