Statistical coding techniques have been used for lossless statistical data compression, applying methods such as Ordinary, Shannon, Fano, Enhanced Fano, Huffman and Shannon-Fano-Elias coding methods. A new and improved coding method is presented, the Fano-Huffman Based Statistical Coding Method. It holds the advantages of both the Fano and Huffman coding methods. It is more easily applicable th...

Test power and test time have been the major issues for current scenario of VLSI testing. The test data compression is the well known method used to reduce the test time. The don’t care bit filling method can be used for effective test data compression as well as reduction in scan power. In this paper we describe the algorithm for don’t care assignment like MT(Minimum Transition)-fill technique...

In this paper we consider the class of anti-uniform Huffman codes and derive tight lower and upper bounds on the average length, entropy, and redundancy of such codes in terms of the alphabet size of the source. The Fibonacci distributions are introduced which play a fundamental role in AUH codes. It is shown that such distributions maximize the average length and the entropy of the code for a ...

Huffman coding is a widely used method for lossless data compression because it optimally stores data based on how often the characters occur in Huffman trees. An n-ary Huffman tree is a connected, cycle-lacking graph where each vertex can have either n “children” vertices connecting to it, or 0 children. Vertices with 0 children are called leaves. We let hn(q) represent the total number of n-a...

Let P(i) = (1 0)B’ be a peobability assignment on the set of nonnegative integers where 0 is an arbitrary real number, 0 < 0 < 1. We show that an optimal binary source code for this probabiliiy assignment is constructed as follows. Let I be the integer satisfying 0’ + @+ 1 < 1 < 8’ + @-I and represent each nonnegative integer i as i = b’+ r when j = [i/l], the integer part of i/l, and r = [i] m...

Adaptive (variable-length) codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. This class of codes has been presented in [10, 11] as a new class of non-standard variable-length codes. Generalized adaptive codes (GA codes, for short) have been also presented in [10, 11] not only as a new class of nonstandard variable-leng...

The ISO JPEG Still Image Compression Standard is popularly known for its DCT-based compression technique, but its non-DCT based lossless mode of operation is less well known. Lossless JPEG uses a form of discrete pulse code modulation (DPCM) [3]. That is, a linear combination of a pixel’s left, upper and upper left neighbors is used to predict the pixel’s value, and the difference between the p...

Individuals with severe motor impairments commonly enter text using a single binary switch and symbol scanning methods. We present a new scanning method -Huffman scanning - which uses Huffman coding to select the symbols to highlight during scanning, thus minimizing the expected bits per symbol. With our method, the user can select the intended symbol even after switch activation errors. We des...

We study a special case of Hamming-Huffman trees, in which both data compression and error detection are tackled on the same structure. Given hypercube Q n dimension , we interested some aspects its vertex neighborhoods. For subset L vertices neighborhood is defined as union neighborhoods . The minimum problem that determining cardinality over all those sets This well-known has already been sol...