prefix code

A set of bit strings in which no code is the start of another, so a stream of codes can be decoded without separators.

In more detail

Because codes sit only at the leaves of a binary tree, reading bits and walking from the root always ends at exactly one symbol. Huffman coding builds the optimal prefix code for given frequencies.

Related terms

Taught in

References