International Journal of Computer Applications
Data compression is a technique to represent data using less number of bits than original data. There are various data compression techniques available, but still there is a need to achieve more compression ratio. This paper proposes an algorithm that combines the features of both Huffman's algorithm and LZW algorithm to achieve more compression ratio. This algorithm is named as VJ Zip. In the new algorithm VJ Zip, for compression, firstly every duplicate occurrence of data is replaced with the pointer to its previous occurrence to obtain partially compressed data.