Text file compression using huffman coding

Zainon, Nur Syazwani (2025) Text file compression using huffman coding. Project Report. Universiti Teknikal Malaysia Melaka, Melaka, Malaysia. (Submitted)

Text (Full Text) Text file compression using huffman coding.pdf - Submitted Version Download (2MB)

Abstract

With the amount of data growing exponentially in the digital era, text file efficiency in transmission and storage is a major challenge. This research investigates the application of Huffman Coding, a well-known lossless data compression technology, for text file compression. The goal is to create a method that keeps the original information intact while drastically reducing the size of text files. Huffman Coding assigns variable-length binary codes to characters based on their frequencies, which ensures that more often occurring characters have shorter codes and less frequently occurring characters have longer codes. By utilizing the unique prefix rule, which forbids any code from becoming a prefix of another, this technique minimizes the overall file size and removes any potential for ambiguous decoding. The project is to create a Huffman Tree using a min-heap data structure, analyse the frequency of characters in a text file, and create Huffman codes for every character. The text file's characters are then changed using these codes, producing a compressed output that uses less storage space. Significant file size reductions, data integrity preservation, and real-world examples of the useful uses of Huffman Coding are among the anticipated results. In addition to improving data transmission speed and storage efficiency, this research seeks to give a greater grasp of the theoretical and practical elements of lossless text file compression. The system's performance will be evaluated through extensive testing and assessment, opening the door for potential future improvements in text compression methods. This study emphasizes how crucial it is to handle data well and provides a solid answer to the problems associated with organizing massive amounts of text data.

Actions (login required)

View Item