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

• 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/1/76181_Increasing%20the%20runs%20in%20compressed_SCOPUS.pdf; http://irep.iium.edu.my/76181/7/16CTN-7972-kamal.pdf; http://irep.iium.edu.my/76181/; https://www.ingentaconnect.com/content/asp/jctn/2019/00000016/00000003/art00017

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