Publication

Abstract : Data compression is a widespread requisite for the majority of the computer applications these days, and numerous algorithms have been suggested for this purpose. It is important to choose the best among these proposed algorithms. In this paper, we discuss a new lossless compression technique for text file compression. This algorithm combines two techniques of Variable Bit Representation–Word-based compression and Character-based compression and is called Hybrid Compression technique. Here, the distinct repetitive values of a word and character are represented as binary values where the word/character with the highest frequency are assigned the lowest binary(0) value and the subsequent word/ character is assigned the next value(1) and so on. These words along with their assigned bit values are stored in an index table. This new hybrid algorithm is compared with the word-based and character-based techniques to assess its ability in compression of data files. This article deduces which technique works efficiently for data compression.