In this paper we prove a new analytic inequality for logarithms and apply it for the Noiseless Coding Theorem.