is paper is concerned with coding theorems for a generalized wiretap channel. In the problem of the wiretap channel it is crucial to characterize the secrecy capacity, i.e., the maximum achievable rate of information securely transmitted from a sender to a receiver in the presence of a wiretapper. In our model channels are not restricted to memoryless channels. In fact, channels can be any discrete channels. We first define the secrecy capacity C{sub}s and characterize C{sub}s from the information-spectrum approach. We give a new upper bound of C{sub}s and explore conditions under which the obtained upper bound coincides with a known lower bound 5. We also discuss coding theorems on the generalized wiretap channel under a weakened criterion on secrecy.
展开▼
