Some Coding Theorems Based on Three Types of the Exponential Form of Cost Functions

In the present communication three generalizations of 'useful' mean length of codewords of memoryless source outputs are given. Lower and upper bounds are also derived for these generalized 'useful' mean lengths in terms of 'useful' R-norm entropy