As we have seen that Huffman coding has been widely used in data, image, and video compression. In this paper novel maximal prefix coding is introduced. Relationship between the Huffman coding and the optimal maximal prefix coding are discussed. We show that all Huffman coding schemes are optimal maximal prefix coding schemes and that conversely the optimal maximal prefix coding schemes need no...

A loss-less compression technique is proposed which uses a variable length Region formation technique to divide the input file into a number of variable length regions. Huffman codes are obtained for entire file after formation of regions. Symbols of each region are compressed one by one. Comparisons are made among proposed technique, Region Based Huffman compression technique and classical Huf...

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

Of late, image compression has become crucial due to the rising need for faster encoding and decoding. To achieve this objective, present study proposes use of canonical Huffman coding (CHC) as an entropy coder, which entails a lower decoding time compared binary codes. For compression, discrete wavelet transform (DWT) CHC with principal component analysis (PCA) were combined. The lossy method ...

We give a polynomial-time approximation scheme for the generalization of Huffman coding in which codeword letters have nonuniform costs (as in Morse code, where the dash is twice as long as the dot). The algorithm computes a (1 + )-approximate solution in time O(n+ f( ) log n), where n is the input size.

Some data compression techniques use large numbers of prefix-free codes. The following two techniques do so: adaptive Huffman encoding and bit recycling. Adaptive Huffman encoding allows successive symbols to be encoded where each one is encoded according to the statistics of the symbols seen so far. Bit recycling, on the other hand, is a technique that is designed to improve the efficiency of ...

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. It is intended as a summary of work published mainly by Titchener and Nicolescu. 1 A brief Introduction to T-Codes This paper f...