Plain Text Encoding/Decoding Technique Using a Combination of Huffman and Run-Length Algorithms

Abstract

This work is devoted to study the effect of applying a hybrid encoding/decoding algorithm to textual data. The sole purpose is to analyze the effect on the size as well as the complexity of the output encoded data. The proposed combination is that of Huffman and Run-Length algorithms. This study focuses on the sequence of applying the two algorithms to see if it has an effect on the output data or not, and the impact of input data format on the result. Results show that the data format and the sequence in which the algorithms are applied actually affect the output. Moreover, it is shown why these two algorithms were chosen and each of them contribute to the overall result.