A Lossless Compression Method for Chat Messages Based on Huffman Coding and Dynamic Programming

A Lossless Compression Method for Chat Messages Based on Huffman Coding and Dynamic Programming

Blog Article

There is always an increasing demand for data storage and transfer; therefore, data compression will always be a fundamental need.In this article, we propose a lossless data compression method focused on a particular kind of data, namely, chat messages, which are typically non-formal, short-length strings.This method can be considered a hybrid because it combines two different algorithmic approaches: greedy #4 MEDIUM BROWN algorithms, specifically Huffman coding, on the one hand and dynamic programming on the other (HCDP = Huffman Coding + Dynamic Programming).

The experimental results demonstrated that our method provided lower compression ratios when compared with six reference algorithms, with reductions between 23.7% and 39.7%, whilst the average remained below the average value reported in several related works found in the literature.

Such performance carries a sacrifice in speed, however, which does not presume major Grocery practical implications in the context of short-length strings.