The Arbitrarily Varying Relay Channel

@article{Pereg2018TheAV,
  title={The Arbitrarily Varying Relay Channel},
  author={Uzi Pereg and Yossef Steinberg},
  journal={2018 IEEE International Symposium on Information Theory (ISIT)},
  year={2018},
  pages={461-465}
}
  • Uzi Pereg, Y. Steinberg
  • Published 1 June 2018
  • Mathematics, Computer Science
  • 2018 IEEE International Symposium on Information Theory (ISIT)
We study the arbitrarily varying relay channel, and establish the cutset bound, decode-forward bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider deterministic coding schemes, and derive the deterministic code capacity, under certain conditions. 
The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division
  • Uzi Pereg, Y. Steinberg
  • Computer Science, Mathematics
    2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2018
TLDR
It is observed that when the channel input is subject to a low power limit, the deterministic code capacity may be strictly lower than the random code capacity, and the gap vanishes as the input becomes less constrained.
The Arbitrarily Varying Channel With Colored Gaussian Noise
TLDR
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 Arbitrarily Varying Channel with Colored Gaussian Noise
  • Uzi Pereg, Y. Steinberg
  • Computer Science, Mathematics
    2020 IEEE International Symposium on Information Theory (ISIT)
  • 2020
TLDR
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
TLDR
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).
Tight List-Sizes for Oblivious AVCs under Constraints
TLDR
For any oblivious AVCs potentially with constraints on the sender's transmitted sequence and the adversary's noise sequence, the exact value of the minimum list-size is determined that can support a reliable communication at positive rate.

References

SHOWING 1-10 OF 100 REFERENCES
Coding of arbitrarily varying multiuser channels
  • J. Jahn
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1981
TLDR
The capacity region for the arbitrarily varying multiple-access channel is determined, and a region of achievable rate triplets for the general broadcast channel is given including as special cases all capacity regions known until now for broadcast channels.
The arbitrarily varying degraded broadcast channel with causal side information at the encoder
  • Uzi Pereg, Y. Steinberg
  • Computer Science
    2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
TLDR
This work establishes inner and outer bounds on both the random code capacity region and the deterministic code capacity area of the arbitrarily varying degraded broadcast channel (AVDBC), when state information is available at the transmitter in a causal manner.
The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division
  • Uzi Pereg, Y. Steinberg
  • Computer Science, Mathematics
    2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
  • 2018
TLDR
It is observed that when the channel input is subject to a low power limit, the deterministic code capacity may be strictly lower than the random code capacity, and the gap vanishes as the input becomes less constrained.
The Arbitrarily Varying Degraded Broadcast Channel with States Known at the Encoder
TLDR
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.
Exponential error bounds for random codes in the arbitrarily varying channel
  • T. Ericson
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1985
TLDR
Random codes for the arbitrarily varying channel are investigated, where a quantity called key rate is used as a measure of the rate of increase.
The arbitrarily varying channel under constraints with causal side information at the encoder
  • Uzi Pereg, Y. Steinberg
  • Mathematics, Computer Science
    2017 IEEE International Symposium on Information Theory (ISIT)
  • 2017
TLDR
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.
Arbitrary jamming can preclude secure communication
TLDR
If the arbitrarily varying wiretap channel possesses a bad “averaged” state, namely one in which the legitimate receiver is degraded with respect to the eavesdropper, then secure communication is not possible.
On multiple user channels with state information at the transmitters
TLDR
The capacity (region) of degraded broadcast channels and physically degraded relay channels where the channel state information is causally available at the transmitters is characterized.
On the white Gaussian multiple-access relay channel
TLDR
This work attempts to quantify improvement in spectral efficiency of mobile radio networks by introducing the multiple-access relay channel (MARC) and deriving capacity results for it.
Elimination of correlation in random codes for arbitrarily varying channels
SummaryThe author determines for arbitrarily varying channelsa)the average error capacity andb)the maximal error capacity in case of randomized encoding. A formula for the average error capacity in
...
1
2
3
4
5
...