The Huffman tree is a well known concept in data compression discovered by David Huffman in 1952 [7]. A Huffman tree is a binary tree and represents the most efficient binary code for a given alphabetwith respect to a distribution of frequency of its characters. In this paper, we associate any Huffman tree of n leaves with the point in Qn having as coordinates the length of the paths from the r...

We introduce a joint decoding algorithm for a Huffman source code followed by a convolutional channel code. The algorithm incorporates a restriction to valid Huffman codewords into the convolutional code’s trellis. Performance is improved by this restriction. Furthermore, soft Huffman decoding is implicitly included, and a priori probabilities of input symbols can be easily exploited, if availa...

Individuals with severe motor impairments commonly enter text using a single binary switch and symbol scanning methods. We present a new scanning method -Huffman scanning - which uses Huffman coding to select the symbols to highlight during scanning, thus minimizing the expected bits per symbol. With our method, the user can select the intended symbol even after switch activation errors. We des...

We study a special case of Hamming-Huffman trees, in which both data compression and error detection are tackled on the same structure. Given hypercube Q n dimension , we interested some aspects its vertex neighborhoods. For subset L vertices neighborhood is defined as union neighborhoods . The minimum problem that determining cardinality over all those sets This well-known has already been sol...

In this study, the focus was on the use of ternary tree over binary tree. Here, a new two pass Algorithm for encoding Huffman ternary tree codes was implemented. In this algorithm we tried to find out the codeword length of the symbol. Here I used the concept of Huffman encoding. Huffman encoding was a two pass problem. Here the first pass was to collect the letter frequencies. You need to use ...

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 discussed. This algorithm is used to form regions whose size is adjusted depending on the ASCII value difference of elements in the file. One of the techniques is Size Adaptive Region Based Huffman Compression (SARBH) where H...

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...

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...