A kind of Non-DMC erasure wiretap channel

This paper is to consider the situation where K data bits are encoded into N > K bits and transmitted via a discrete memoryless channel (DMC). An intruder observes data from the receiver via a general erasure wiretap channel, which is not necessary to be DMC. Our goal is to design the encoder-decoder to maximize intruder's uncertainty about the sent data while the receiver can recover the sent K data bits perfectly. An outer bound of this new communication model including the transmission rate and equivocation is established. It is interesting that the bound is in fact the capacity region of the case with discrete memoryless erasure wiretap channel (DMEC). The capacity region of a special case of the new model, when the intruder uniformly randomly chooses μ < N bits to observe, is proved.