ProCreate producing recurrent patterns in files for improved compression

• Main Authors: Centeno, Antonio L., III, De Real, Lovimelle G., Flores, Dino Z., Mamaril, Dharil L.
• Format: text
• Language: English
• Published: Animo Repository 2007
• Subjects: Computer Sciences
• Online Access: https://animorepository.dlsu.edu.ph/etd_bachelors/14406
• Institution: De La Salle University

Redundancy in information theory is defined as the number of bits used to transmit a message minus the number of bits of actual information in the message. Redundant information basically means that such data share commodities. File lengths are shortened through data compression with the use of several algorithms. Most file compression algorithms to date utilize on counting redundant patterns or on dictionary methods to replace patterns into shorter symbolic representation. Certain files contain less redundant patterns, therefore renders the compression algorithm less effective. By inducing a pre-compression stage wherein it improves the recurrence of patterns in these types of files, the data compression algorithms may improve its effectiveness. This study explores beyond the feasibility of introducing pre-commission stage before compressing files. The proposed pre-compression stage will include operations and a key in order to work. Such pre-compression stage will attempt to increase the redundancy in files to enable compression to effectively compress data.