OVER AN ARBITRARILY VARYING CHANNEL Rudolf Ahlswede and Ning Cai Abstract It is well{known that the deterministic code capacity (for the average error probability criterion) of an arbitrarily varying channel (AVC) either equals its random code capacity or zero. Here it is shown that if two components of a correlated source are additionally available to the sender and receiver, respectively, the...

We establish the deterministic-code capacity region of a network with one transmitter and two receivers: an “ordinary receiver” and a “robust receiver.” The channel to the ordinary receiver is a given (known) discrete memoryless channel (DMC), whereas the channel to the robust receiver is an arbitrarily varying channel (AVC). Both receivers are required to decode the “common message,” whereas o...

Finite blocklength and second-order (dispersion) results are presented for the arbitrarily-varying channel (AVC), a classical model wherein an adversary can transmit arbitrary signals into the channel. A novel finite blocklength achievability bound is presented, roughly analogous to the random coding union bound for non-adversarial channels. This finite blocklength bound, along with a known con...

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 encoder has state information in a causal manner. Lower and upper bounds on the random code capacity are developed. A lower bound on the deterministic code ...

To transmit information by timing arrivals to a singleserver queue, we consider using the exponential server channel’s maximum-likelihood decoder. For any server with service times that are stationary and ergodic with mean 1 seconds, we show that the rate 1 nats per second (capacity of the exponential server timing channel) is achievable using this decoder. We show that a similar result holds f...

The question of robust direct communication in vehicular networks is discussed. In most stateof-the-art approaches, there is no central entity controlling channel access, so there may be arbitrary interference from other parties. Thus, a suitable channel model for Vehicle-to-X (V2X) communication is the Arbitrarily Varying Channel (AVC). Employing multiple antennas on a vehicle or sending over ...

The discrete additive multiple-access arbitrarily varying channel (AVC) with two senders and one receiver is considered. Necessary and sufficient conditions are given for its deterministic-code average-probability-of-error capacity region under a state constraint to have a nonempty interior. In the case that no state constraint is present, the capacity region is characterized exactly. In the ca...

Let X = I1, " '" , a}, Y = {1, ' " , b} be finite sets. A stochastic matrix w with a rows and b columns will be called a channel. X, Y are the input and output alphabets (respectively) of the channel. We denote the set of all channels with input alphabet X and output alphabet Y by e (X, Y). A channel w E C (X, Y) can be used for communication from one person, the sender, to another person, the ...

Ahstrucf -We consider the capacity of an arbitrarily varying channel (AVC) for deterministic codes with the average probability of error critenon and, typically, subject to a state constraint. First, sufficient conditions are provided that enable (relatively) simple decoding rules such as typicality, maximum mutual information, and minimum distance, to attain capacity. Then the (possibly noisy)...

We consider a system model of a general finite–state machine (ratchet) that simultaneously interacts with three kinds of reservoirs: a heat reservoir, a work reservoir, and an information reservoir, the latter being taken to be a running digital tape whose symbols interact sequentially with the machine. As has been shown in earlier work, this finite–state machine can act as a demon (with memory...