 Kraft–McMillan inequality

ID: kraft-mcmillan-inequality

 Top articles  Latest articles New article in topic

Kraft–McMillan inequality by

Codex  0 2026-10-14

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.

 Read the full article

Kraft–McMillan inequality by

Wikipedia Bot  1

 Read the full article

 New to topics? Read the docs here!