-It is demonstrated that for finite-alphabet, Kth order ergodic Markov Sources (i.e., memory of K letters), a variable-to-fixed code is better than the best fixed-to-variable code (Huffman code). It is shown how to construct a variable-to-fixed length code for a Kth order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code (Huffman code).

In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the encoded symbols and proposed a memory efficient data structure to represent the codeword length of ...

Usage of Image has been increasing and used in many applications. Image compression plays vital role in saving storage space and saving time while sending images over network. A new compression technique proposed to achieve more compression ratio by reducing number of source symbols. The source symbols are reduced by applying source symbols reduction and further the Huffman coding is applied to...

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 describes the derivation of the T-complexity and T-information theory from the decomposition of finite strings, based on the duality of strings and variable-length T-codes. It further outlines its similarity to the string parsing algorithm by Lempel and Ziv. In its first version [15], it was intended as a summary of work published mainly by Titchener and Nicolescu. Apart from minor c...

Novel coding schemes are introduced and relationships between optimal codes and Huffman codes are discussed. It is shown that, for finite source alphabets, the Huffman coding is the optimal coding, and conversely the optimal coding needs not to be the Huffman coding. It is also proven that there always exists the optimal coding for infinite source alphabets. We show that for every random variab...

A new Huffman coding and decoding technique is presented. There is no need to construct a full size Huffman table in this technique; instead, the symbols are encoded directly from the table of code-lengths. For decoding purposes a new Condensed Huffman Table (CHT) is also introduced. It is shown that by employing this technique both encoding and decoding operations become significantly faster, ...