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 C/sub r/, 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)=C/sub r/ for L展开▼
机译：对于具有固定列表大小L的确定性列表代码，研究了离散无记忆任意变化信道（AVC）的容量。对于具有正随机代码容量C / sub r /的每个AVC，定义了一个非负整数M，称为对称性。对于平均错误概率准则，表明对于L 展开▼
