Bound on exponential mean codeword length of size d alphabet 1: 1 code

Abstract

In the present communication we define the codes which assign d - alphabet one-one codeword to each of a random variable and the functions which represent possible transformations from codeword length of a nonone code to codeword length of a uniquely decodable code. By using these functions we obtain bounds on the exponentiated mean codeword length for one-one code of size d - alphabet in terms of Renyi entropy and study the particular cases also.