Title :
Move-to-front and permutation based inversion coding
Author_Institution :
Dept. of Math. & Comput.Sci., State Univ. Coll., Fredonia, NY, USA
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
Keywords :
adaptive codes; data compression; sorting; MTF coder; PBIC; adaptive self-organizing list technique; alphabet size; block sorting techniques; canonical sorting permutations; compression gain; data file compression; data source; move-to-front based inversion coding; permutation based inversion coding; Computer science; Data compression; Educational institutions; Mathematics; Sorting;
Conference_Titel :
Data Compression Conference, 1999. Proceedings. DCC '99
Conference_Location :
Snowbird, UT
Print_ISBN :
0-7695-0096-X
DOI :
10.1109/DCC.1999.785672