• Journal of applied mathematics & informatics
• /
• v.8 no.3
• /
• pp.881-888
• /
• 2001

Recently, Hooda and Ram [7] have proposed and characterized a new generalized measure of R-norm entropy. In the present communication we have studied its application in coding theory. Various mean codeword lengths and their bounds have been defined and a coding theorem on lower and upper bounds of a generalized mean codeword length in term of the generalized R-norm entropy has been proved.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.2
• /
• pp.3-8
• /
• 2007

In this paper a generalized parametric mean length $L(P^{\nu},\;R)$ has been defined and bounds for $L(P^{\nu},\;R)$ are obtained in terms of generalized R-norm information measure.