Kraft nierówności

Kraft inequality If integers satisfy:
then, a prefix condition code of alphabet length D exists, with these integers as codeword lengths.
A convenient graphical representation of a code is a tree built of branches connecting nodes, with sequences assigned to nodes, codewords (sequences satisfying the prefix condition) assigned to terminal nodes (leafs). Each branch connects two nodes located at different levels, starting from the level zero down to the level . Sequences assigned to nodes at the first level are alphabet letters. Sequences of the length , assigned to nodes at the i -th level, have prefixes assigned to nodes at the -th level, supplemented with one alphabet letter
... zobacz całą notatkę