LOWER BOUNDS ON $L^t_{1:1}(D)$ IN TERMS OF RENYI ENTROPY
Rishabh Sharma, P. GUPTA, R.K. Tuteja · Tamkang Journal of Mathematics · 1991
In this paper we obtain the lower bounds for the exponentiated mean codeword length (as defined by Campbell [4]) for one-one codes of size $D$ by using the functions which represent possible transformations from one-one codes of size $D$ to uniquely decodable codes.