Lines Matching full:alphabet
321 alphabet by bit sequences (codes), one code for each symbol, in
329 labeled with) the symbols of the alphabet; then the code for a
364 Given an alphabet with known symbol frequencies, the Huffman
368 alphabet). Such a code is called a Huffman code. (See
380 The Huffman codes used for each alphabet in the "deflate"
407 follows, assuming that the order of the alphabet is ABCD:
419 Given this rule, we can define the Huffman code for an alphabet
421 the alphabet in order; this is sufficient to determine the
467 Consider the alphabet ABCDEFGH, with bit lengths (3, 3, 3, 3,
603 distinct alphabets: either literal bytes, from the alphabet of
607 alphabets are merged into a single alphabet (0..285), where
670 for the literal/length alphabet are:
710 compressed using a Huffman code. The alphabet for code lengths
726 the literal/length or distance alphabet will not occur in the
749 alphabet given just above, in the order: 16, 17, 18,
757 HLIT + 257 code lengths for the literal/length alphabet,
760 HDIST + 1 code lengths for the distance alphabet,
