Kraft’s number and ideal word packing

In the noiseless context, it has long been known that the average encoded word length of an instantaneous or uniquely decipherable code can be made to lie between the source entropy and that value plus unity. We address the question of finding sufficient conditions on the code–word probabilities for it to be possible to make the average code–word length approximate the entropy by a smaller prescribed amount.