Lines Matching refs:codeword

16 decoded output corresponding to a given compressed codeword.
66 total of \varname{[codebook_entries]}, is assigned a codeword length.
67 We now read the list of codeword lengths and store these lengths in
73   If the \varname{[ordered]} flag is unset, the codeword list is not
74   length ordered and the decoder needs to read each codeword length
80   codeword decode tree:
97               5) codeword length for this entry is [length]+1;
108         8) the codeword length for this entry is [length]+1;
115   If the \varname{[ordered]} flag is set, the codeword list for this
117   a length for every codeword, the encoder reads the number of
136 After all codeword lengths have been decoded, the decoder reads the
205 codebooks support unused codeword entries) is assigned, in order, the
206 lowest valued unused binary Huffman codeword possible.  Assume the
207 following codeword length list:
221 length to highest) results in the following codeword list:
224 entry 0: length 2 codeword 00
225 entry 1: length 4 codeword 0100
226 entry 2: length 4 codeword 0101
227 entry 3: length 4 codeword 0110
228 entry 4: length 4 codeword 0111
229 entry 5: length 2 codeword 10
230 entry 6: length 3 codeword 110
231 entry 7: length 3 codeword 111
238 right, thus the codeword '001' is the bit string 'zero, zero, one'.
243 It is clear that the codeword length list represents a Huffman
257 via the length list.  In the above example, if codeword seven were
267 populated and a ninth codeword is impossible.  Both underspecified and
275 process.  They have no codeword and do not appear in the decision
374 codeword from the bitstream, decoding it into an entry number, and then
390 reading and decoding the next codeword in the bitstream. The decoder
391 reads bits until the accumulated bits match a codeword in the
401 When used in a scalar context, the resulting codeword entry is the
404 When used in a VQ context, the codeword entry number is used as an