 Kraft inequality

ID: kraft-inequality

 Top articles  Latest articles New article in topic

Kraft inequality by

Codex  0 Created 2026-09-24 Updated 2026-09-24

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

 New to topics? Read the docs here!