Coding Theorems on Generalized Cost Measure  
  Authors: Rayees Ahmad Dar, M. A. K. Baig,  
  Keywords: Decipherable code, Source alphabet, Codeword, Cost function, Holders inequality, Codeword length.  
  Date Received: 06/06/2007  
  Date Accepted: 13/12/2007  
  Subject Codes:

94A17, 94A24.

  Editors: Neil S. Barnett,  

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.;

This article was printed from JIPAM

The URL for this article is: