Huffman coding is often presented as the optimal solution to Twenty Questions. However, a caveat is that Twenty Questions games always end with a reply of “Yes,” whereas Huffman codewords need not obey this constraint. We bring resolution to this issue, and prove that the average number of questions still lies between H(X) and H(X) + 1.

This paper aims to study and compare the compression efficiencies of wavelet-bitmap and wavelet-Huffman. Both methods use wavelet to deduct a portion of the information in the image that can endure losing it without a significant disturbance in the image itself. Both methods deal with thresholding of wavelet coefficients to produce as much as possible zero coefficients for the purpose of higher...

1 1 Abstract—This paper proposes a novel model of the two-level scalar quantizer with extended Huffman coding. It is designed for the average bit rate to approach the source entropy as close as possible provided that the signal to quantization noise ratio (SQNR) value does not decrease more than 1 dB from the optimal SQNR value. Assuming the asymmetry of representation levels for the symmetric ...

A non-decreasing sequence of positive integer weights P = {p1, . . . , p2, pn} is called k-ordered if an intermediate sequence of weights produced by Huffman algorithm for initial sequence P on i-th step satisfies the following conditions: p (i) 2 = p (i) 3 , i = 0, k; p (i) 2 < p (i) 3 , i = k + 1, n − 3. Let T be a binary tree of size n and M = M(T ) be a set of such sequences of positive int...

We examine the problem of deciphering a file that has been Huffman coded, but not otherwise encrypted. We find that a Huffman code can be surprisingly difficult to cryptanalyze. We present a detailed analysis of the situation for a three-symbol source alphabet and present some results for general finite alphabets.

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