There are no discussions about this article yet.

 Articles by others on the same topic (1)

The lengths of every decipherable binary code satisfy

\sum_{i} 2^{- l_{i}} \leq 1.

Conversely, any positive integer lengths satisfying this bound can be realized by a prefix code.

Kraft–McMillan inequality