There is an instantaneous binary code with n codewords of length l₁,l₂,…l_n if and only if $\sum _1^n{2}^{-l_i}\le 1.$ This is most easily seen using a binary rooted tree, as a codeword of length l precludes 2^–l of the remainder of the tree, codewords for which it would be a prefix.