한국과학기술정보연구원 과학기술정보센터 Korea Institute of Science and Technology Information
In this paper we define a two parametric new generalized useful average code-word length (P;U) and its relationship with two parametric new generalized useful information measure (P;U) has been discussed. The lower and upper bound of (P;U), in terms of (P;U) are derived for a discrete noiseless channel. The measures defined in this communication are not only new but some well known measures are the particular cases of our proposed measures that already exist in the literature of useful information theory. The noiseless coding theorems for discrete channel proved in this paper are verified by considering Huffman and Shannon-Fano coding schemes on taking empirical data. Also we study the monotonic behavior of (P;U) with respect to parameters and . The important properties of (P;U) have also been studied.