# The Arbitrarily Varying Broadcast Channel With Causal Side Information at the Encoder

@article{Pereg2020TheAV, title={The Arbitrarily Varying Broadcast Channel With Causal Side Information at the Encoder}, author={Uzi Pereg and Yossef Steinberg}, journal={IEEE Transactions on Information Theory}, year={2020}, volume={66}, pages={757-779} }

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…

## 5 Citations

The Arbitrarily Varying Channel With Colored Gaussian Noise

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2021

Super-additivity is demonstrated, showing that the deterministic code capacity can be strictly larger than the weighted sum of the parametric capacities in the AVC with colored Gaussian noise.

The Capacity Region of the Arbitrarily Varying MAC: With and Without Constraints

- Computer Science, Mathematics2019 IEEE International Symposium on Information Theory (ISIT)
- 2019

We determine both the random code capacity region and the deterministic code capacity region of the arbitrarily varying multiple access channel (AVMAC) under input and state constraints. For the…

The Arbitrarily Varying Channel with Colored Gaussian Noise

- Computer Science, Mathematics2020 IEEE International Symposium on Information Theory (ISIT)
- 2020

The capacity of the AVC with colored Gaussian noise is established, where double water filling is performed in the frequency domain, and both the deterministic and random code capacities are determined and super-additivity is demonstrated.

Quadratically Constrained Two-way Adversarial Channels

- Physics, Computer Science2020 IEEE International Symposium on Information Theory (ISIT)
- 2020

Upper and lower bounds on the capacity of this channel which match each other and equal 1 2 + SNR are provided, in the high- SNR regime (where SNR, signal to noise ratios, is defined as the ratio of the power constraints of the users to the power constraint of the jammer).

Undoing Causal Effects of a Causal Broadcast Channel with Cooperating Receivers using Entanglement Resources

- Computer Science, MathematicsArXiv
- 2021

It is found that when the receivers can share entanglement and communicate classically, they can receive messages from the sender at a non-zero rate with verifiable secure collaboration.

## References

SHOWING 1-10 OF 81 REFERENCES

The arbitrarily varying channel under constraints with causal side information at the encoder

- Mathematics, Computer Science2017 IEEE International Symposium on Information Theory (ISIT)
- 2017

A generalized non-symmetrizability condition is stated, under which the deterministic code capacity coincides with the random code capacity, in the setting where a state constraint is imposed on the jammer, while the user is under no constraints.

The Arbitrarily Varying Degraded Broadcast Channel with States Known at the Encoder

- Computer Science2006 IEEE International Symposium on Information Theory
- 2006

The techniques used in this work can be used to derive an inner bound on the capacity region of an arbitrarily varying degraded broadcast channel without CSIR.

The Arbitrarily Varying Channel Under Constraints With Side Information at the Encoder

- Computer ScienceIEEE Transactions on Information Theory
- 2019

This work studies the arbitrarily varying channel with input and state constraints, when the encoder has state information in a causal or noncausal manner, and determines the random code capacity of the AVC under input andstate constraints.

Achievable rates for the broadcast channel with states known at the transmitter

- Computer ScienceProceedings. International Symposium on Information Theory, 2005. ISIT 2005.
- 2005

The region derived is shown to be tight for the Gaussian broadcast channel with additive interference at the two channels.

Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information

- Computer ScienceIEEE Transactions on Information Theory
- 2005

The results on noncausal coding can be used to derive the capacity region of a watermarking system where the channel (attacker) is fixed, and the watermark is subject to several stages of attack, or the encoder is required to encode watermarks for both private and public users.

State-Dependent Degraded Broadcast Channels with Non-Causal Encoder Side Information

- Computer Science
- 2017

This paper considers a discrete memoryless state dependent broadcast channel, where the state process is non-causally known at the encoder and presents inner and outer bounds on the capacity region of this setup.

On the Capacity of the Discrete Memoryless Broadcast Channel With Feedback

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2013

A coding scheme for the discrete memoryless broadcast channel with {noiseless, noisy, generalized} feedback is proposed, and the associated achievable region derived. The scheme is based on a…

Random coding theorem for broadcast channels with degraded components

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 1973

This paper generalizes Cover's results on broadcast channels with two binary symmetric channels (BSC) to the class of degraded channels with N components, and shows a procedure to expurgate a good random broadcast code leading to a bound on the maximum probability of error.

Arbitrarily Varying Wiretap Channel with State Sequence Known or Unknown at the Receiver

- Computer Science, MathematicsArXiv
- 2017

It is concluded that the secrecy capacity of stochastic code is identical to that of random code when the receiver knows the state sequence, and random code may achieve larger secrecy capacity when the state sequences is unknown by the receiver.

Semi-Robust Communications Over a Broadcast Channel

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2019

It is established that the deterministic-code capacity region of a network with one transmitter and two receivers: an ordinary receiver and a robust receiver is either empty or else the intersection of the capacity regions of the broadcast channels that the various states induce.