Search

1 article for “Adaptive Huffman Algorithm”

• Published Subscription 31 May 2023

  Adaptive Huffman Algorithm for Data Compression Using Text Clustering and Multiple Character Modification

  By Babita Kumari, Neeraj Kumar Kamal, Arif Mohammad Sattar, Mritunjay Kr. Ranjan

  Abstract: Adaptive Huffman algorithm is a popular data compression technique that creates a variable-length binary code for each symbol in a message. However, the original algorithm may not be efficient in compressing text data, particularly when dealing with long sequences of repeated characters. In this study, we propose a novel approach to enhance the compression ratio of the Adaptive Huffman algorithm by utilizing text clustering and multiple character modification. The proposed …

  Published in Recent Trends in Programming languages · Vol. 10, Issue 1, 2023 · pp. 30–40 Read article →