Compound Arbitrarily Varying Channels

2021/05/07 by Chaudhuri, Syomantak, Sangwan, Neha, Bakshi, Mayank +2
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.2105.03420

Abstract

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.

Related

• On the Capacity of Compound State-Dependent Channels with States Known at the Transmitter
• Capacity Region Continuity of the Compound Broadcast Channel with Confidential Messages
• Covert Communication Over a Compound Channel
• Equivalence for Networks with Adversarial State
• Compound Channel Capacities under Energy Constraints and Application