Main Article Content

Abstract

Compaction helps to remove duplicity in the representation of data which further reduces the need of storage in it. The task of compaction is to free up valuable space on a web server typically by encoding techniques. A Huffman code is a specific type of best prefix code that is often used to compress lossless data. In this paper, many other techniques adopted by various researchers are described which help in compacting redundant data and improve proficiency on Huffman coding. Some of the suggested techniques like arithmetic coding, minutia score matching; Hybrid quantized technique and JPEG image coding etc. provide higher compaction than earlier Huffman coding.

Article Details