The capacity of the discrete memoryless arbitrarily varying channel (AVC) is investigated for deterministic list codes with fixed list size L. For every AVC with positive random code capacity Cr , a nonnegative integer M called the symmetrizability is defined. For the average probability of error criterion, it is shown that the list capacity is given by C(L)=Cr for L>M and C(L)=0 otherwise. Bounds are given which relate Cr and M. Also, explicit formulas for C(L) are given for a family of noiseless, additive AVCs
Published in:
Information Theory, IEEE Transactions on
(Volume:43
,
Issue:
3
)
Date of Publication: May 1997