THE SMALLEST LIST FOR THE ARBITRARILY VARYING CHANNEL

The capacity of the discrete memoryless arbitrarily varying channel (A VC) is investigated for deterministic list codes with fixed list size L. For every AVC with positive random code capacity C-r, a nonnegative integer M called the symmetrizability is defined, For the average pro bability of error criterion, it is shown that the list capacity is giv en by C(L) = C-r for L > M and C(L) = 0 otherwise. Bounds are given wh ich relate C-r and M. Also, explicit formulas for C(L) are given for a family of noiseless, additive AVC's.