Wiretap Channels: Implications of the More Capable Condition and Cyclic Shift Symmetry
Omur Ozel, Sennur Ulukus

TL;DR
This paper simplifies the characterization of the rate-equivocation region in certain wiretap channels by identifying conditions under which auxiliary variables are optimal, focusing on more capable and cyclic shift symmetric channels.
Contribution
It provides explicit solutions and optimal strategies for the rate-equivocation region in classes of wiretap channels, including more capable and cyclic shift symmetric types.
Findings
V=X is optimal when the main channel is more capable.
Explicit optimal U and V are determined via cyclic shifts in symmetric channels.
U=ϕ is optimal for certain cyclic shift symmetric channels.
Abstract
Characterization of the rate-equivocation region of a general wiretap channel involves two auxiliary random variables: U, for rate splitting and V, for channel prefixing. Evaluation of regions involving auxiliary random variables is generally difficult. In this paper, we explore specific classes of wiretap channels for which the expression and evaluation of the rate-equivocation region are simpler. In particular, we show that when the main channel is more capable than the eavesdropping channel, V=X is optimal and the boundary of the rate-equivocation region can be achieved by varying U alone. Conversely, we show under a mild condition that if the main receiver is not more capable, then V=X is strictly suboptimal. Next, we focus on the class of cyclic shift symmetric wiretap channels. We explicitly determine the optimal selections of rate splitting U and channel prefixing V that achieve…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · graph theory and CDMA systems
