Article citationsMore>>

Ferreira, A.J., Oliveira, A.L. and Figueiredo, M.A.T. (2009) On the Suitability of Suffix Arrays for Lempel-Ziv Data Compression. In: Filipe, J., Obaidat, M.S., Eds., e-Business and Telecommunications. ICETE 2008, Communications in Computer and Information Science, Vol. 48, Springer, Berlin, Heidelberg.

has been cited by the following article:

• TITLE: A Complexity Analysis and Entropy for Different Data Compression Algorithms on Text Files

  AUTHORS: Mohammad Hjouj Btoush, Ziad E. Dawahdeh

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

  JOURNAL NAME: Journal of Computer and Communications, Vol.6 No.1, January 12, 2018

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