Abstract
In this paper, a wiretap channel where the transmitter and receiver communicate through a discrete memoryless channel, and the eavesdropper (Eve) has perfect access to a fixed fraction of transmitted symbols (of its choosing) is considered. An outer bound for the rate-equivocation region of the channel, for all such fractions, is derived. An achievable scheme, which provides an inner bound for the rate-equivocation region, is proposed. The achievability is established by defining a class of good codebooks for which there exists a good partition that achieves the required level of equivocation no matter what subset of symbols Eve chooses. It is shown that, for a uniform input distribution, the probability of this class of good codes approaches 1 as the block length increases. This generalizes the wiretap II model to one with a noisy main channel.
Recommended Citation
M. Nafea and A. Yener, "Wiretap Channel Ii with a Noisy Main Channel," IEEE International Symposium on Information Theory - Proceedings, pp. 1159 - 1163, article no. 7282637, Institute of Electrical and Electronics Engineers, Sep 2015.
The definitive version is available at https://doi.org/10.1109/ISIT.2015.7282637
Department(s)
Electrical and Computer Engineering
International Standard Book Number (ISBN)
978-146737704-1
International Standard Serial Number (ISSN)
2157-8095
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
28 Sep 2015
