The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division

@article{Pereg2018TheAV,
  title={The Arbitrarily Varying Gaussian Relay Channel with Sender Frequency Division},
  author={Uzi Pereg and Yossef Steinberg},
  journal={2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2018},
  pages={1097-1103}
}
  • Uzi Pereg, Y. Steinberg
  • Published 29 May 2018
  • Computer Science, Mathematics
  • 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. 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. A second model addressed in this paper is the general case of primitive… 
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 Relay Channel
  • Uzi Pereg, Y. Steinberg
  • Mathematics, Computer Science
    2018 IEEE International Symposium on Information Theory (ISIT)
  • 2018
TLDR
The random code capacity for special cases is determined, and deterministic coding schemes are considered, and the deterministic code capacity is derived, under certain conditions.
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 Myopic Adversarial Channels
TLDR
For a certain range of the noise-to-signal ratios (NSRs) of the transmitter and the jammer, the capacity of this channel under deterministic encoding is characterized.
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.
The Arbitrarily Varying Relay Channel †
TLDR
The arbitrarily varying relay channel, which models communication with relaying in the presence of an active adversary, is studied, and the cutset bound and partial decode-forward bound on the random code capacity are established and the deterministic code capacity is determined.

References

SHOWING 1-10 OF 31 REFERENCES
The Arbitrarily Varying Relay Channel
  • Uzi Pereg, Y. Steinberg
  • Mathematics, Computer Science
    2018 IEEE International Symposium on Information Theory (ISIT)
  • 2018
TLDR
The random code capacity for special cases is determined, and deterministic coding schemes are considered, and the deterministic code capacity is derived, under certain conditions.
Gaussian arbitrarily varying channels
TLDR
The results suggest that reliable communication is impossible at any positive code rate if the jammer is subject only to an average power constraint, and the asymptotic error probability suffered by optimal random codes in these cases is determined.
The capacity of the arbitrarily varying channel revisited: Positivity, constraints
TLDR
The capacity of the AVC is determined with constraints on the transmitted codewords as well as on the channel state sequences, and it is demonstrated that it may be positive but less than the corresponding random code capacity.
A New Upper Bound on the Capacity of a Primitive Relay Channel Based on Channel Simulation
  • F. Xue
  • Mathematics, Computer Science
    IEEE Transactions on Information Theory
  • 2014
An upper bound on the capacity of a primitive three-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. The
Capacity Approximations for Gaussian Relay Networks
TLDR
This paper provides an improved lower bound on the rate achieved by the compress-and-forward-based strategies (noisy network coding in particular) in arbitrary Gaussian relay networks, whose gap to capacity depends on the network not only through the total number of nodes but also through the degrees of freedom of the min cut of the network.
The geometry of the relay channel
TLDR
The techniques for solving Cover's problem can be naturally extended to the general Gaussian case, where the channels from the source to the relay and destination may be asymmetric, and an upper bound is proved on the capacity C(C<inf>0</inf>) of ageneral Gaussian relay channel for any C<inf>(∞), which implies that the previous conclusion holds in the asymmetric case.
Arbitrarily varying channels with constrained inputs and states
TLDR
Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with constraints on the transmitted codewords and channel state sequences and the AVC is shown to have a (strong) random coding capacity.
Arbitrarily Varying Wiretap Channels With Type Constrained States
TLDR
The capacity formula shows that the legitimate users effectively see an averaged main channel, while security must be ensured versus an eavesdropper with perfect channel state information, thus strengthening the previously best known single-letter upper bound by Liang et al. that has a min-max form.
On the Deterministic-Code Capacity of the Two-User Discrete Memoryless Arbitrarily Varying General Broadcast Channel With Degraded Message Sets
  • E. Hof, S. Bross
  • Mathematics, Computer Science
    IEEE Transactions on Information Theory
  • 2006
TLDR
Sufficient non-symmetrizability condition that renders the common message capacity of the AVGBC positive is identified using an approach different from Jahn's, and the various notions of symmetrizable for the two-user broadcast AVC are defined.
Capacity of a class of relay channels with orthogonal components
The capacity of a class of discrete-memoryless relay channels with orthogonal channels from the sender to the relay receiver and from the sender and relay to the receiver is shown to be equal to the
...
1
2
3
4
...