Published Paper Details:

Compression refers to reducing the amount of data bits which used to represent store and/or transmit file content, without excessively reducing the amount of the input data. Data Compression technique can enables exact reproduction of the input data on decomposition which leads to loss in compressed data. The Adaptive Huffman Algorithm with FGK process used to compress the particular set of files without loss of data but the expected result of compression is very poor. To overcome the poor compression, it will be modified along with Vitter algorithm. Vitter Algorithm helps to compress the total number of data files and to produces the better efficiency but the drawback was the execution time of data file. Since it requires more execution time, more space, results are in in efficient of the compressed data. So to rectify the arising problems, this paper introduced Modified Adaptive Huffman algorithm along with Lempel-Ziv-Welch (LZW) Algorithm. Lempel-Ziv-Welch is a data based technical algorithm which compresses the repetitive sequences of data very well. LZW requires no earlier data about the information stream and it can pack the info stream in one single go with its straight forwardness and enabling quick execution to bring the first content information document with highest compression ratio.