A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus its depth. Golumbic (1976) introduced minimax trees and gave a Huffman-like, O(n log n)-time algorithm for building them. Drmota and Szpankowski (2002) gave another O(n log n)-time algorithm, which checks the Kraft Inequali...

An example of application of the wavelet transform to electrocardiography is described in the paper. The transform is exploited as a first stage of an ECG signal compression algorithm. The signal is decomposed into particular time-frequency components. Some of the components are removed because of their low influence to signal shape due to nonstationary character of ECG. Resulted components are...

In this paper we present a reversible image steganography technique based on Slantlet transform (SLT) and using advanced encryption standard (AES) method. The proposed method first encodes the message using two source codes, viz., Huffman codes and a self-synchronizing variable length code known as, T-code. Next, the encoded binary string is encrypted using an improved AES method. The encrypted...

In this paper, we studied the cascading of LZ variants to Huffman coding for multilingual documents. Two models are proposed: the static model and the adaptive (dynamic) model. The static model makes use of the dictionary generated by the LZW algorithm in the Chinese dictionary based Huffman compression to achieve better performance. The dynamic model is an extension of the static cascading mod...

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

We introduce a novel method for representing and coding wideband signals using permutations. The signal samples are first sorted, and then encoded using Differential Pulse Coding Modulation. We show that our method is optimal for DPCM coding and develop a novel algorithm for encoding the permutation information efficiently. We show that the new algorithm achieves coding gains over Huffman coding.

LOCO-I (LOw COmplexity LOssless COmpression for Images) is a novel lossless compression algorithm for continuous-tone images which combines the simplicity of Huffman coding with the compression potential of context models, thus “enjoying the best of both worlds.” The algorithm is based on a simple fixed context model, which approaches the capability of the more complex universal context modelin...

In this paper, a reversible and robust acoustic watermarking based on lossless compression is proposed. Stereo speech data is represented by 16 bit for each sampling point and then divided into frames. Then Huffman lossless compression algorithm is applied to insignificant 4 bits in each sampling point partiality to reserve hiding capacity. An average of 0.7035 and the best 0.686 compression ra...

Columnar Oriented Database is an enhance approach to service to service the needs of Business Intelligence. A Columnar Oriented Database Management system that stores content by columns rather than the row. This type of data differs from traditional database with regards to performance, storage requirements and easy to modification of the schema. One of the major advantage of column based datab...