Paper 2, Section , G
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.
Paper 2, Section , G
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.