Huffman's algorithm for computing minimum-redundancy prefix-free codes has almost
legendary status in the computing disciplines. Its elegant blend of simplicity and applicability …

In this paper, we focus on the use of quaternary tree instead of binary tree to speed up the
decoding time for Huffman codes. It is usually difficult to achieve a balance between speed …

Compression is a process that is always carried out in terms of digitizing data, which is
considered very important, especially in the development and growth of the Big Data era …

Wireless nano-sensor networks (WNSNs), which consist of nano-sensors a few hundred
nanometers in size with the capability to detect and sense new types of events in nano …

Huffman (1952) codes are being widely used in image and video compression. We propose
a decoding scheme coding for Huffman codes, which requires only a few computations per …

To reduce the memory size and speed up the process of searching for a symbol in a
Huffman tree, we propose a memory-efficient array data structure to represent the Huffman …

Improving encoding and decoding time in compression technique is a great demand to
modern users. In bit level compression technique, it requires more time to encode or decode …

We present a new data structure for Huffman coding in which in addition to sending symbols
in order of their appearance in the Huffman tree one needs to send codes of all circular leaf …

Based on the breadth-first search manner and the level-compression technique, this article
first presents a new array data structure to represent the classical Huffman (1952) tree. Then …

This article proposes two dynamic Huffman based code generation algorithms, namely
Octanary and Hexanary algorithm, for data compression. Faster encoding and decoding …