Arbitrarily varying channels with constrained inputs and states

Random coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with constraints on the transmitted codewords and channel state sequences. Two types of constraints are considered: peak (i.e. required for each n-length sequence almost surely) and average (over the message set or over an ensemble). For peak constraints on the codewords and on the channel state sequences, the AVC is shown to have a (strong) random coding capacity. If the codewords and/or the channel state sequences are constrained in the average sense, the AVCs do not possess (strong) capacities; only epsilon -capacities are shown to exist.<
>