Increasing the runs in compressed data using a dedicated move to front algorithm

Al-Khayyat, Kamal A. and Alshaikhli, Imad Fakhri Taha (2019) Increasing the runs in compressed data using a dedicated move to front algorithm. Journal of Computational and Theoretical Nanoscience, 16 (3). pp. 903-906. E-ISSN 1546-1955

	PDF (scopus) - Supplemental Material Restricted to Repository staff only Download (397kB) | Request a copy
	PDF (pdf) - Published Version Restricted to Repository staff only Download (73kB) | Request a copy

Abstract

Compressed data is a random data with high entropy and low redundancy, so they are hard for another round of compression. Reducing the randomness of compressed data is a step towards dealing with this problem. We detail a modification to the MTF (Move-to-front) algorithm that is able to reduce the randomness of compressed data by increasing the number of runs and its corresponding quality. The experiments confirmed that our modification results in better value and increased runs among randomly selected sequences. Two formats were tested; binary and alpha-betical representation. Both reported increasing runs and qualities. A common feature was found in the alphabetical representation. The ratios of the number of each simple symbol to its file size is similar in the case of the selected compression format.

Item Type:	Article (Journal)
Additional Information:	6534/76181
Uncontrolled Keywords:	Block Sorting; Burrows-Wheeler Transform; Move-to-Front; Prediction; Random
Subjects:	T Technology > T Technology (General) > T10.5 Communication of technical information
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	Professor Imad Taha
Date Deposited:	12 Dec 2019 09:54
Last Modified:	12 Dec 2019 09:54
URI:	http://irep.iium.edu.my/id/eprint/76181

Actions (login required)

View Item