Compression and Coding Algorithms
Compression and Coding Algorithms
Foundations of Algorithms Using C++ Pseudocode
Foundations of Algorithms Using C++ Pseudocode
Data Compression: The Complete Reference
Data Compression: The Complete Reference
An adaptive character wordlength algorithm for data compression
Computers & Mathematics with Applications
A Concise Introduction to Data Compression (Undergraduate Topics in Computer Science)
A Concise Introduction to Data Compression (Undergraduate Topics in Computer Science)
| Hi-index | 0.09 |
Data compression via the Huffman algorithm, which is a data compression technique, is the most efficient technique between single symbol data compression techniques. This algorithm is counted among statistical data compression techniques. Many efforts have been made for optimizing this technique and some algorithms have been presented, too. One of these algorithms is the ACW algorithm which is presented by Hussein Al-Bahadili et al. At first, they used the Huffman algorithm and then used the results of the Huffman algorithm as the input of their algorithm to calculate the optimum character wordlength. So, they decreased the stored characters via increasing the character wordlength for doing the compression. In this paper, we examined and criticized the ACW algorithm and presented some of its weaknesses via suitable counterexamples. At the end, it was concluded that the optimum character wordlength can never be calculated by extant techniques.