Showing papers on "Canonical Huffman code published in 1980"

Method and apparatus for digital Huffman encoding

Abstract: Coding and decoding method and apparatus are disclosed for implementation of a novel truncated Huffman type code using different length code words. Input signals to be encoded have different probabilities of occurance, and the most frequently occuring signals are assigned the shortest code words. Infrequently occuring input signals are labelled using one of the code words. The set of different length code words employed in the invention include a single binary 1 bit at the least significant bit position of each of the code words. Decoding simply includes means for counting the number of binary 0 bits between the 1 bits of the code word stream.

Sources which maximize the choice of a Huffman coding tree

Abstract: Since the introduction of the Huffman algorithm (Huffman, 1952) for optimum coding of discrete noiseless sources with specific symbol probabilities, certain combinatorial problems have naturally suggested themselves. One of these is the problem of enumerating the distinct binary trees which correspond to the different available codes. The number of topologically distinct trees has been investigated (cf. Franklin and Golomb, 1975) but this is not a good formulation of the problem. The number of coding-distinct trees for n source symbols is more properly defined as the number of solutions of the Kraft-McMillan Equality, in the form

Some integer Huffman sequences (Corresp.)

Abstract: A class of real integer Huffman sequences is presented. The zero pattern of the z -transform of these sequences indicates a general method for their synthesis.