IEEE International Symposium on Information Theory (ISIT)
The Covert Capacity of Channels with Action-Dependent States at Both the Transmitter and the Receiver
Hassan ZivariFard, Xiaodong Wang, Alexei Ashikhmin
Abstract
This paper studies covert communication of positive rate, i.e., reliable and covert communication on the order of N bits in N channel uses, over a channel with Action-Dependent State Information (ADSI) when the ADSI is known either non-causally, causally, or strictly causally by both the transmitter and the receiver, and when the ADSI is only known by the receiver. We derive the covert capacity for these problems, which subsumes the capacity of channels with random states at both the transmitter and the receiver. As an application of our problem setup, we study and solve the problem of covert communication over state-dependent Multiple-Access Channels (MACs) with a common message and states known at one of the transmitters and the receiver. Unlike state-dependent point-to-point channels, we show that strictly causal Channel State Information (CSI) can help achieve a positive covert rate in state-dependent MACs.