In the proposed Huffman LEACH model, energy consumption increases exponentially with distance and there are no maximum limits. The transmit power level of a sensor node can only be adjusted to discrete values that may result in one for various distances. resulting two links different distances equivalent. number clusters generated does not converge fixed value which shortens lifespan network. w...

Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.

Huffman coding has been widely used in data, image, and video compression. Novel maximal prefix coding different from the Huffman coding is introduced. Relationships between the Huffman coding and optimal maximal prefix coding are discussed. We show that all Huffman coding schemes are maximal prefix coding schemes and have the shortest average code word length among maximal prefix coding scheme...

ABSTRACT Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable length that is a most frequent symbol has length smaller than a less frequent symbol. The traditional Huffman coding has two procedures: co...

The construction of optimal prefix codes plays a significant and influential role in applications concerning information processing and communication. For decades, different algorithms were proposed treating the issue of Huffman codes construction and various optimizations were introduced. In this paper we propose a detailed practical time-efficient parallel algorithm for generating Huffman cod...

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