|| Compound Arbitrarily Varying Channels
||Syomantak Chaudhuri, IIT Bombay, India; Neha Sangwan, Tata Institute of Fundamental Research, India; Mayank Bakshi, Huawei, Hong Kong SAR of China; Bikash Kumar Dey, IIT Bombay, India; Vinod M. Prabhakaran, Tata Institute of Fundamental Research, India|
||D2-S1-T1: Nonstandard Channels
||Tuesday, 13 July, 22:00 - 22:20
||Tuesday, 13 July, 22:20 - 22:40
We propose a communication model, that we call compound arbitrarily varying channels (CAVC), which unifies and generalizes compound channels and arbitrarily varying channels (AVC). A CAVC can be viewed as a noisy channel with a fixed, but unknown, compound-state and an AVC-state which may vary with every channel use. The AVC-state is controlled by an adversary who is aware of the compound-state. We study three problems in this setting: 'communication', 'communication and compound-state identification', and 'communication or compound-state identification'. For these problems, we study conditions for feasibility and capacity under deterministic coding and random coding.