On certain coding theorems connected with generalized useful information measure of order R and type ?
In the present communication three non-additive generalized cost measures of utilities and lengths of output codewords by a memoryless source are defined and their lower and upper bounds in terms of non-additive generalized useful information measure are derived.
94a17 94a24