Abstract
We study the arbitrarily varying channel (AVC) with input and state constraints, when the encoder has state information in a causal or noncausal manner. For the causal state information setting, we develop lower and upper bounds on the random code capacity. A lower bound on the deterministic code capacity is established in the case of a message-averaged input constraint. In the setting where a state constraint is imposed on the jammer, while the user is under no constraints, the random code bounds coincide, and the random code capacity is determined. Furthermore, for this scenario, a generalized non-symmetrizability condition is stated, under which the deterministic code capacity coincides with the random code capacity. For the noncausal state information setting, we determine the random code capacity of the AVC under input and state constraints. In addition, a condition on the channel is stated, under which the deterministic code capacity coincides with the random code capacity.
Original language | English |
---|---|
Article number | 8423717 |
Pages (from-to) | 861-887 |
Number of pages | 27 |
Journal | IEEE Transactions on Information Theory |
Volume | 65 |
Issue number | 2 |
DOIs | |
State | Published - Feb 2019 |
Keywords
- Arbitrarily varying channel
- Gel'fand-Pinsker channel
- Shannon strategies
- causal state information
- deterministic code
- minimax theorem
- noncausal state information
- random code
- side information
- symmetrizability
All Science Journal Classification (ASJC) codes
- Information Systems
- Library and Information Sciences
- Computer Science Applications