The binary <Kraft inequality> states that codeword lengths $l(a)$ of a <prefix code>, or more generally a uniquely decodable code, satisfy
$$
\sum_a2^{-l(a)}\leq1.
$$
Conversely, positive integer lengths obeying this inequality can be realized by a binary prefix code.

Solution

Past exam of the mathematics course of the University of Cambridge / 2021 / iii / Paper 224 / 4 / a / Solution

 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2021/iii/paper-224/4/a/solution