Research Article Open Access

Huffman Based Code Generation Algorithms: Data Compression Perspectives

Ahsan Habib1, M. Jahirul Islam1 and M. Shahidur Rahman1
  • 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.

Journal of Computer Science
Volume 14 No. 12, 2018, 1599-1610

DOI: https://doi.org/10.3844/jcssp.2018.1599.1610

Submitted On: 18 July 2018 Published On: 9 December 2018

How to Cite: Habib, A., Islam, M. J. & Rahman, M. S. (2018). Huffman Based Code Generation Algorithms: Data Compression Perspectives. Journal of Computer Science, 14(12), 1599-1610. https://doi.org/10.3844/jcssp.2018.1599.1610

  • 3,324 Views
  • 2,810 Downloads
  • 3 Citations

Download

Keywords

  • Binary Tree
  • Quaternary Tree
  • Octanary Tree
  • Hexanary Tree
  • Huffman Principle
  • Decoding Technique
  • Encoding Technique
  • Tree Data Structure
  • Data Compression