Search | Science Publications

Research ArticleOpen accessIn the keywordsHuffman Based Code Generation Algorithms: Data Compression PerspectivesAhsan Habib, M. Jahirul Islam, M. Shahidur RahmanThis 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 … …Journal of Computer Science, Vol. 14, Issue 12 · 9 Dec 2018 · 7,701 accessesView PDF Cite

1 result for “Hexanary Tree”