Abstract
In this paper, we study the arbitrarily varying broadcast channel (AVBC) when the state information is available at the transmitter in a causal manner. We establish the inner and outer bounds on both the random code capacity region and the deterministic code capacity region with degraded message sets. The capacity region is then determined for a class of channels satisfying a condition on the mutual information between the strategy variables and the channel outputs. As an example, we consider the arbitrarily varying binary symmetric broadcast channel. We show the cases where the condition holds and, hence, the capacity region is determined and other cases where there is a gap between the bounds. This gap shows that the minimax theorem does not hold for rate regions.
| Original language | English |
|---|---|
| Article number | 8758333 |
| Pages (from-to) | 757-779 |
| Number of pages | 23 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 66 |
| Issue number | 2 |
| DOIs | |
| State | Published - Feb 2020 |
Keywords
- Arbitrarily varying channel
- Shannon strategies
- broadcast channel
- causal state information
- degraded message sets
- deterministic code
- minimax theorem
- random code
- side information
- symmetrizability
All Science Journal Classification (ASJC) codes
- Information Systems
- Library and Information Sciences
- Computer Science Applications
Fingerprint
Dive into the research topics of 'The Arbitrarily Varying Broadcast Channel With Causal Side Information at the Encoder'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver