Huffman Tree Compression and Lempel-Ziv Coding Using Java

Lossless data compression is necessary to reduce transmission costs while maintaining data integrity. This paper describes Kompressor as a Huffman and Lempel Ziv (LZ) compression algorithm project using Java. All major Java class implementations are discussed in detail. The algorithm is evaluated for three different files to measure performance such as compression ratio, code rate, and efficiency. The program is shown to be capable of performing compression and decompression as proposed in the original algorithm for different parameter values. Huffman encoding, in particular, is capable of shrinking files to less than 70% of their original file size. It is hoped that this project will be useful for academic and scientific purposes, especially for courses based on data compression.