Author(s)

Mohammad Hjouj Btoush, Ziad E. Dawahdeh

Department of Computer Science, Al-Balqa Applied University, Mutah University, Karak, Jordan.

In this paper, we analyze the complexity and entropy of different methods of data compression algorithms: LZW, Huffman, Fixed-length code (FLC), and Huffman after using Fixed-length code (HFLC). We test those algorithms on different files of different sizes and then conclude that: LZW is the best one in all compression scales that we tested especially on the large files, then Huffman, HFLC, and FLC, respectively. Data compression still is an important topic for research these days, and has many applications and uses needed. Therefore, we suggest continuing searching in this field and trying to combine two techniques in order to reach a best one, or use another source mapping (Hamming) like embedding a linear array into a Hypercube with other good techniques like Huffman and trying to reach good results.

Text Files, Data Compression, Huffman Coding, LZW, Hamming, Entropy, Complexity

Btoush, M. and Dawahdeh, Z. (2018) A Complexity Analysis and Entropy for Different Data Compression Algorithms on Text Files. Journal of Computer and Communications, 6, 301-315. doi: 10.4236/jcc.2018.61029.