Coding Theorems on Generalized Cost Measure

摘要

In the present communication a generalized cost measure of utilities and lengths of output codewords from a memoryless source are defined. Lower and upper bounds in terms of a non-additive generalized measure of `useful' information are obtained.