English
Related papers

Related papers: Communication over an Arbitrarily Varying Channel …

200 papers

We study communication systems over state-dependent channels in the presence of a malicious state-aware jamming adversary. The channel has a memoryless state with an underlying distribution. The adversary introduces a jamming signal into…

Information Theory · Computer Science 2017-09-01 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

In this work, we study two models of arbitrarily varying channels, when causal side information is available at the encoder in a causal manner. First, we study the arbitrarily varying channel (AVC) with input and state constraints, when the…

Information Theory · Computer Science 2017-01-23 Uzi Pereg , Yossef Steinberg

We generalize the problem of controlling the interference created to an external observer while communicating over a discrete memoryless channel (DMC) which was studied in \cite{serrano:2014}. In particular, we consider the scenario where…

Information Theory · Computer Science 2021-06-04 Michail Mylonakis , Photios A. Stavrou , Mikael Skoglund

We propose a communication model, that we call compound arbitrarily varying channels (CAVC), which unifies and generalizes compound channels and arbitrarily varying channels (AVC). A CAVC can be viewed as a noisy channel with a fixed, but…

Information Theory · Computer Science 2021-05-10 Syomantak Chaudhuri , Neha Sangwan , Mayank Bakshi , Bikash Kumar Dey , Vinod M. Prabhakaran

The secrecy capacity problems over the general arbitrarily varying wiretap channel (AVWC), with respect to the maximal decoding error probability and strong secrecy criterion, are considered, where the channel state sequence may be known or…

Information Theory · Computer Science 2017-12-05 Dan He , Yuan Luo

In this paper, we take an arbitrarily varying channel (AVC) approach to examine the problem of writing on a dirty paper in the presence of an adversary. We consider an additive white Gaussian noise (AWGN) channel with an additive white…

Information Theory · Computer Science 2015-04-17 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

In this work, we study the arbitrarily varying broadcast channel (AVBC), when state information is available at the transmitter in a causal manner. We establish inner and outer bounds on both the random code capacity region and the…

Information Theory · Computer Science 2017-09-19 Uzi Pereg , Yossef Steinberg

The two-user discrete memoryless state-dependent multiple-access channel (MAC) models a scenario in which two encoders transmit independent messages to a single receiver via a MAC whose channel law is governed by the pair of encoders'…

Information Theory · Computer Science 2010-07-23 Shraga I. Bross , Amos Lapidoth

We consider a state-dependent multiaccess channel (MAC) with state non-causally known to some encoders. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In…

Information Theory · Computer Science 2008-03-30 Shiva Prasad Kotagiri , J. Nicholas Laneman

We consider the problem of authenticated communication over a discrete arbitrarily varying channel where the legitimate parties are unaware of whether or not an adversary is present. When there is no adversary, the channel state always…

Information Theory · Computer Science 2023-05-15 Mayank Bakshi , Oliver Kosut

Arbitrary varying channels (AVC) are used to model communication settings in which a channel state may vary arbitrarily over time. Their primary objective is to circumvent statistical assumptions on channel variation. Traditional studies on…

Information Theory · Computer Science 2024-07-04 Michael Langberg , Oron Sabag

We derive the capacity region of arbitrarily varying multiple-access channels with conferencing encoders for both deterministic and random coding. For a complete description it is sufficient that one conferencing capacity is positive. We…

Information Theory · Computer Science 2012-11-21 Moritz Wiese , Holger Boche

The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting where a message-cognizant rate-limited helper observes the state sequence noncausally, produces its description, and provides the description…

Information Theory · Computer Science 2023-11-15 Amos Lapidoth , Ligong Wang , Yiming Yan

We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another…

Information Theory · Computer Science 2017-04-26 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Pablo Piantanida , Shlomo Shamai

We characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost…

Information Theory · Computer Science 2022-05-16 Yihan Zhang , Sidharth Jaggi , Michael Langberg , Anand D. Sarwate

Joint message and state transmission under arbitrarily varying jamming is investigated in this paper. The problem is modeled as the transmission over a channel with random states with a fixed distribution and jamming that varies in an…

Information Theory · Computer Science 2026-02-19 Yiqi Chen , Holger Boche

The arbitrarily varying channel (AVC) is a conservative way of modeling an unknown interference, and the corresponding capacity results are pessimistic. We reconsider the Gaussian AVC by relaxing the classical model and thereby weakening…

Information Theory · Computer Science 2012-09-14 Anand D. Sarwate , Michael Gastpar

The arbitrarily varying channel (AVC) is a channel model whose state is selected maliciously by an adversary. Fixed-blocklength coding assumes a worst-case bound on the adversary's capabilities, which leads to pessimistic results. This…

Information Theory · Computer Science 2009-10-06 Anand D. Sarwate , Michael Gastpar

We consider keyless authentication for point-to-point communication in the presence of a myopic adversary. In particular, the adversary has access to a non-causal noisy version of the transmission and may use this knowledge to choose the…

Information Theory · Computer Science 2020-01-23 Allison Beemer , Eric Graves , Joerg Kliewer , Oliver Kosut , Paul Yu
‹ Prev 1 2 3 10 Next ›