This paper describes a fast, low-complexity, entropy efficient video coder for wavelet pyramids. This coder approaches the entropy-limited coding rate of video wavelet pyramids, is fast in both hardware and software implementations, and has low complexity (no multiplies) for use in ASICs. It consists of a modified Z-coder used to code the zero/non-zero significance function and Huffman coding f...

Linear Predictive Coding (LPC) is used for analysis and compression of speech signals. Whereas Huffman coding is used forElectrocardiogram (ECG) signal compression. This paper presents a hybrid compression technique for ECG signal using modifiedHuffman encoding andLPC.The aim of this paper is to apply the linear prediction coding and modified Huffman coding for analysis, compression and predict...

A strategy for computing upper code-length limits of AC Huffman codes for an 8x8 block in JPEG Baseline coding is developed. The method is based on a geometric interpretation of the DCT, and the calculated limits are as close as 14% to the maximum code-lengths. The proposed strategy can be adapted to other transform coding methods, e.g., MPEG 2 and 4 video compressions, to calculate close upper...

In this paper, we study the overall performance of two main forms of secret entropy coding – secret Huffman coding and secret arithmetic coding, as solutions to multimedia encryption. We consider a set of criteria, which include not only security but also other aspects of the performance. We draw the conclusion that neither can fulfill all the criteria, but secret arithmetic coding can offer a ...

This paper describes cryptographic methods for concealing information during data compression processes. These include novel approaches of adding pseudo random shuffles into the processes of dictionary coding (Lampel-Ziv compression), arithmetic coding, and Huffman coding. An immediate application of using these methods to provide multimedia security is proposed.

Linear shift registers have been extensively studied since the pioneering work of D. A. Huffman. A general theory was created by Huffman, l Golomb, Elspas, Stern, Friedland, Zierler, Hartmannis, Massey, and others. This progress was mainly due to the identification of the operations performed by linear switching circuits with algebraic operations over Galois fields. There was no general theory ...

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {Xi}lm_, and {x}lm_, is drawn i.i.d. according to joint probability mass function (p.m.f.) p ( z , y); the encoder for each source operates without knowledge of the other source; the decoder jointly decodes the encoded bit streams from both sources. ...