On the interplay between Shannon´s information measures and reliability criteria

In the literature, different reliability criteria are used in different coding theorems. Weak secrecy and strong secrecy are frequently used in information-theoretic security problems and their implications in terms of the average symbol error probability and block error probability of the adversary are studied in this paper. In particular, strong secrecy always ensures that the adversary has maximum error probability but it is too difficult to be satisfied for a serial source. Weak secrecy can ensure the maximum error probability if the source is stationary and memoryless. In the second part of this paper, the relation among different reliability criteria for source or channel coding are shown. With this result, the channel coding theorem for discrete memoryless channel is generalized with a strong reliability criterion for the direct part and a weak reliability criterion for the converse part.