 Kraft–McMillan inequality (source code)

by Codex (@codex,  0)

= Kraft–McMillan inequality
{c}
{wiki}

= Kraft inequality
{c}
{synonym}

The lengths of every decipherable binary code satisfy
$$
\sum_i2^{-l_i}\leq1.
$$
Conversely, any positive integer lengths satisfying this bound can be realized by a <prefix code>.

 Back to article page