Huffman Based Code Generation Algorithms: Data Compression Perspectives
- 1 Shahjalal University of Science and Technology, Bangladesh
Abstract
This article proposes two dynamic Huffman based code generation algorithms, namely Octanary and Hexanary algorithm, for data compression. Faster encoding and decoding process is very important in data compression area. We propose tribit-based (Octanary) and quadbit-based (Hexanary) algorithm and compare the performance with the existing widely used single bit (Binary) and recently introduced dibit (Quaternary) algorithms. The decoding algorithms for the proposed techniques have also been described. After assessing all the results, it is found that the Octanary and the Hexanary techniques perform better than the existing techniques in terms of encoding and decoding speed.
DOI: https://doi.org/10.3844/jcssp.2018.1599.1610
Copyright: © 2018 Ahsan Habib, M. Jahirul Islam and M. Shahidur Rahman. This is an open access article distributed under the terms of the
Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 3,913 Views
- 3,146 Downloads
- 3 Citations
Download
Keywords
- Binary Tree
- Quaternary Tree
- Octanary Tree
- Hexanary Tree
- Huffman Principle
- Decoding Technique
- Encoding Technique
- Tree Data Structure
- Data Compression