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 PDFCite
Research ArticleOpen accessAll words, across the recordBinary Merge Coding for Lossless Image Data CompressionN. Subhash Chandra, M. Bala Raju, M. Arya bahanu et al.Problem statement: Image processing applications were drastically increasing over the years. In such a scenario, the fact that, the digital images need huge amounts of disk space seems to be a crippling disadvantage during transmission and storage. So, there arises a need for data compression of images. Approach: This study proposed a novel technique called binary merge coding for lossless … …Journal of Computer Science, Vol. 5, Issue 5 · 30 May 2009 · 6,861 accessesView PDFCite