Paper 2, Section I, 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.
Typos? Please submit corrections to this page on GitHub.
Paper 2, Section I, 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.