Abstract:
Kraft’s inequality is a classical theorem in Information Theory which
establishes the existence of prefix codes for certain (admissible) length distributions.
We prove the following generalisation of Kraft’s theorem: For
every admissible infinite length distribution one can construct a maximal
prefix codes whose codewords satisfy this length distribution.