Paper 2, Section II, G

Coding \& Cryptography
Part II, 2017

Prove that a decipherable code with prescribed word lengths exists if and only if there is a prefix-free code with the same word lengths.