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

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 r...

Full description

Bibliographic Details
Main Authors:	Al-Khayyat, Kamal A., Alshaikhli, Imad Fakhri Taha
Format:	Article
Language:	English English
Published:	American Scientific Publishers 2019
Subjects:	T10.5 Communication of technical information
Online Access:	http://irep.iium.edu.my/76181/ http://irep.iium.edu.my/76181/ http://irep.iium.edu.my/76181/ http://irep.iium.edu.my/76181/1/76181_Increasing%20the%20runs%20in%20compressed_SCOPUS.pdf http://irep.iium.edu.my/76181/7/16CTN-7972-kamal.pdf

id	iium-76181
recordtype	eprints
spelling	iium-761812019-12-12T01:54:14Z http://irep.iium.edu.my/76181/ Increasing the runs in compressed data using a dedicated move to front algorithm Al-Khayyat, Kamal A. Alshaikhli, Imad Fakhri Taha T10.5 Communication of technical information 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. American Scientific Publishers 2019-03 Article PeerReviewed application/pdf en http://irep.iium.edu.my/76181/1/76181_Increasing%20the%20runs%20in%20compressed_SCOPUS.pdf application/pdf en http://irep.iium.edu.my/76181/7/16CTN-7972-kamal.pdf 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 https://www.ingentaconnect.com/content/asp/jctn/2019/00000016/00000003/art00017 10.1166/jctn.2019.7972
repository_type	Digital Repository
institution_category	Local University
institution	International Islamic University Malaysia
building	IIUM Repository
collection	Online Access
language	English English
topic	T10.5 Communication of technical information
spellingShingle	T10.5 Communication of technical information Al-Khayyat, Kamal A. Alshaikhli, Imad Fakhri Taha Increasing the runs in compressed data using a dedicated move to front algorithm
description	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.
format	Article
author	Al-Khayyat, Kamal A. Alshaikhli, Imad Fakhri Taha
author_facet	Al-Khayyat, Kamal A. Alshaikhli, Imad Fakhri Taha
author_sort	Al-Khayyat, Kamal A.
title	Increasing the runs in compressed data using a dedicated move to front algorithm
title_short	Increasing the runs in compressed data using a dedicated move to front algorithm
title_full	Increasing the runs in compressed data using a dedicated move to front algorithm
title_fullStr	Increasing the runs in compressed data using a dedicated move to front algorithm
title_full_unstemmed	Increasing the runs in compressed data using a dedicated move to front algorithm
title_sort	increasing the runs in compressed data using a dedicated move to front algorithm
publisher	American Scientific Publishers
publishDate	2019
url	http://irep.iium.edu.my/76181/ http://irep.iium.edu.my/76181/ http://irep.iium.edu.my/76181/ http://irep.iium.edu.my/76181/1/76181_Increasing%20the%20runs%20in%20compressed_SCOPUS.pdf http://irep.iium.edu.my/76181/7/16CTN-7972-kamal.pdf
first_indexed	2023-09-18T21:47:41Z
last_indexed	2023-09-18T21:47:41Z
_version_	1777413559981965312

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

Similar Items