A text written using symbols from a given alphabet can be compressed the Huffman code, which minimizes length of encoded text. It is necessary, however, to employ text-specific codebook, i.e. symbol-codeword dictionary, decode original Thus, compression performance should evaluated by full code length, plus codebook. We studied several alphabets for compressing texts – letters, n-grams syllable...

Distance measure plays an important role in clustering data points. Choosing the right distance measure for a given dataset is a non-trivial problem. In this paper, we study various distance measures and their effect on different clustering techniques. In addition to the standard Euclidean distance, we use Bit-Vector based, Comparative Clustering based, Huffman code based and Dominance based di...

WZD (Wavelet Z-coDec) is a component or composite video codec engineered and optimized to greatly reduce the ASIC silicon implementation area in return for a modest degradation of the R-D (rate/distortion) tradeoff. It consists of wavelet transforms organized into a carefully designed pyramid, dyadic quantization, and a novel application of Zcoding and Huffman coding to entropy code the wavelet...

The paper presents the method of transferring PCM (Pulse-Code Modulation) based audio messages through SMS (Short Message Service) over GSM (Global System for Mobile Communications) network. As SMS is text based service, and could not send voice. Our method enables voice transferring through SMS, by converting PCM audio into characters. Than Huffman coding compression technique is applied in or...

The color satellite image compression technique by vector quantization can be improved either by acting directly on the step of constructing the dictionary or by acting on the quantization step of the input vectors. In this paper, an improvement of the second step has been proposed. The knearest neighbor algorithm was used on each axis separately. The three classifications, considered as three ...

Data compression has been widely used in many Information Retrieval based applications like web search engines, digital libraries, etc. to enable the retrieval of data to be faster. In these applications, universal codes (Elias codes (EC), Fibonacci code (FC), Rice code (RC), Extended Golomb code (EGC), Fast Extended Golomb code (FEGC) etc.) have been preferably used than statistical codes (Huf...

This paper introduces a new class of Huffman decoders which is a developmet of the parallel Huffman decoder model. With pipelining and partitioning, a regular architecture with an arbitrary degree of pipelining is developed. The proposed architecture dramatically reduces the symbol decoder requirements compared to previous results, and still is the actual implementation of the symbol decoder no...

An error resilient video coding scheme based on unequal error protection over error prone channels is proposed. Due to the sensitivity of VLC to channel errors, a single bit error can cause loss of synchronization at the receiver, leading to catastrophic degradation of image quality. Multiplexed codes are an effective approach to combat losses of synchronization. In this paper, multiplexed code...

This paper propose a novel Image compression based on the Huffman encoding and decoding technique. Image files contain some redundant and inappropriate information. Image compression addresses the problem of reducing the amount of data required to represent an image. Huffman encoding and decoding is very easy to implement and it reduce the complexity of memory. Major goal of this paper is to pr...