A loss less dictionary based data compression technique has been proposed in this paper
which is based on the optimality of LZW code. The compression process is started with …

A lossless dictionary-based data compression technique has been proposed in this paper
which is the modified form of compression technique based on optimality of LZW code …

Adaptive Huffman algorithm is a popular data compression technique that creates a variable-
length binary code for each symbol in a message. However, the original algorithm may not …

Wireless Sensor network is capable of sensing communication and computation. It is made
up of thousands of miniature devices. A bridge between the existent physical and virtual …

The adaptive Huffman coding with a window of limited distinct symbols is proposed. The
window buffer is used to store a specified number of distinct symbols most recently …

Adaptive version of loss-less Region Based Huffman compression techniques are proposed
where a proposed region formation algorithm is used to divide the input file into a number of …

Research articles are known to be concise and straight to the point however, studies have
shown that promotional strategies have permeated into the writings of the scientific authors …

In this paper, the comparative studies of Adaptive Region Based Huffman compression
techniques are done. All these techniques use a region formation algorithm that is also …

A way of improvement of compression ratio of fractal image compression is proposed in this
paper. The improvement of compression rates is done by applying the lossless compression …

In this paper, the performance in terms of compression rates of fractal image compression
using Fast Context Independent HV partitioning (FCI-HV) scheme and its variant fractal …