Non-Additive Generalized "Useful" \(R\)-norm Information Measures and Coding Theorem

Abstract

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