Arbitrarily varying channels with constrained inputs and states

Abstract-Random coding theorems are proved for discrete memory-less arbitrarily varying channels (AVCs) with constraints on the trans-mitted codewords and channel state sequences. We consider two types of constraints peak (i.e., required for eacb n-length sequence almost d y) and average (over the message set or over an ensemble). For peak constraints on the c o d e d and on the channel state sequences, the AVC is shown to have a (strong) random coding capacity. If the oodewords and/or the channel state sequences are constrained in the average sense, the AVCs do not possess (strong) Capacities; only r-cap&tk are shown to exist. I