OurBigBook.comSite Source code

Kraft inequality

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.

Table of contents 52 1
- Total length lower bound for a decipherable binary code Kraft inequality 29

 Ancestors (7)

 Incoming links (3)