Block huffman coding

Dynamic or adaptive Huffman coding, proposed by Gallager [1] and extended by Knuth [21, can be used for compressing a continuous stream. Our proposal for accomplishing the same task is termed here as block Huffman coding. This is an easy and simple solution to compress continuous data by applying simple Huffman coding in blocks of data. For each block, a different header is stored. This header is shipped with each block of compressed data. However, to keep the header overhead low, we have used the proposed storage efficient header [3].