A Complexity Analysis and Entropy for Different Data Compression Algorithms on Text Files
| Autor: | Ziad E. Dawahdeh, Mohammad Hjouj Btoush |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science
Data_CODINGANDINFORMATIONTHEORY 02 engineering and technology Huffman coding Linear array symbols.namesake 0202 electrical engineering electronic engineering information engineering symbols Entropy (information theory) Embedding 020201 artificial intelligence & image processing Hypercube Algorithm Hamming code Data compression |
| Zdroj: | Journal of Computer and Communications. :301-315 |
| ISSN: | 2327-5227 2327-5219 |
| DOI: | 10.4236/jcc.2018.61029 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|