 Code-distribution correspondence

Lengths of a binary prefix code satisfy $K={\sum }_x{2}^{-L(x)}\le 1$ and therefore define the probability mass function $R(x)=2^{-L(x)}/K$. Conversely, a mass function gives ideal lengths $-{\log }_{2}R(x)$ and integer prefix lengths after rounding.