1Department of Statistics, Maharshi Dayanand University, Rohtak, India.
2Department of Mathematics, Amity School of Engineering, Amity University, Noida, U.P., India.
Brijpaul and Sharma [1988] gave a direct method of computing the performance function of a discrete memoryless communication channels. They obtained the performance function for discrete channels by using Shannon entropy which is additive in nature, but in some situations additivity does not hold good. In such situations, non-additivity prevails. In this paper, we are giving an algorithm for computing the performance function for generalized? entropy of discrete memoryless communication channel under multiple constraints in which the mutual information has been defined in terms of Havrda and Charvat [1967] entropy of degree? which is non-additive in nature.
