Papers
Topics
Authors
Recent
2000 character limit reached

Capacity of the State-Dependent Wiretap Channel: Secure Writing on Dirty Paper

Published 18 May 2016 in cs.IT and math.IT | (1605.05693v1)

Abstract: In this paper we consider the State-Dependent Wiretap Channel (SD-WC). As the main idea, we model the SD-WC as a Cognitive Interference Channel (CIC), in which the primary receiver acts as an eavesdropper for the cognitive transmitter's message. By this point of view, the Channel State Information (CSI) in SD-WC plays the role of the primary user's message in CIC which can be decoded at the eavesdropper. This idea enables us to use the main achievability approaches of CIC, i.~e., Gel'fand-Pinsker Coding (GPC) and Superposition Coding (SPC), to find new achievable equivocation-rates for the SD-WC. We show that these approaches meet the capacity under some constraints on the rate of the channel state. Similar to the dirty paper channel, extending the results to the Gaussian case shows that the GPC lead to the capacity of the Gaussian SD-WC which is equal to the capacity of the wiretap channel without channel state. Hence, we achieve the capacity of the Gaussian SD-WC using the dirty paper technique. Moreover, our proposed approaches provide the capacity of the Binary SD-WC. It is shown that the capacity of the Binary SD-WC is equal to the capacity of the Binary wiretap channel without channel state.

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.