Abstract: In the present communication, we have studied
different variations in the entropy measures in the different states of
queueing processes. In case of steady state queuing process, it has
been shown that as the arrival rate increases, the uncertainty
increases whereas in the case of non-steady birth-death process, it is
shown that the uncertainty varies differently. In this pattern, it first
increases and attains its maximum value and then with the passage of
time, it decreases and attains its minimum value.
Abstract: The objective of the present communication is to
develop new genuine exponentiated mean codeword lengths and to
study deeply the problem of correspondence between well known
measures of entropy and mean codeword lengths. With the help of
some standard measures of entropy, we have illustrated such a
correspondence. In literature, we usually come across many
inequalities which are frequently used in information theory.
Keeping this idea in mind, we have developed such inequalities via
coding theory approach.