| 1. | Satisfying the Kraft inequality, we can construct a prefix code as follows.
|
| 2. | Huffman coding is a more sophisticated technique for constructing variable-length prefix codes.
|
| 3. | Prefix codes are always uniquely decodable, and these in turn are always non-singular:
|
| 4. | The trunk prefix code for direct-dialed long-distance in the NANP is also 1.
|
| 5. | In general, most prefix codes for integers assign longer codewords to larger integers.
|
| 6. | A special case of prefix codes are block codes.
|
| 7. | Kraft's inequality characterizes the sets of codeword lengths that are possible in a prefix code.
|
| 8. | :It could be the reversal of a prefix code.
|
| 9. | The engine prefix code was TCS on these bikes.
|
| 10. | Meteor issue new numbers with the prefix code 085.
|
