Lines Matching refs:tree
80 codeword decode tree:
198 \paragraph{Huffman decision tree representation}
202 tree used for entropy decoding.
244 decision tree with the entry numbers equivalent to the leaves numbered
249 \captionof{figure}{huffman tree illustration}
256 Note that it's possible to underspecify or overspecify a Huffman tree
258 eliminated, it's clear that the tree is unfinished:
262 \captionof{figure}{underspecified huffman tree illustration}
266 Similarly, in the original codebook, it's clear that the tree is fully
276 tree, thus it's impossible for any bit pattern read from the stream to
393 Huffman decode tree by reading one bit at a time from the bitstream,
396 Walking the tree finishes when the decode process hits a leaf in the
397 decision tree; the result is the entry number corresponding to that