 Total length lower bound for a decipherable binary code

If a decipherable binary code has $N$ codewords of lengths $l_1,\dots ,l_N$, thenThis follows by applying the entropy lower bound with the uniform source distribution.