Estimation of the size of the list when decoding over an arbitrarily varying channel (Q4954407)

In ``Capacity of the arbitrarily varying channel under list decoding'' [Probl. Inf. Transm. 31, No. 2, 99-113 (1995); translation from Probl. Peredachi Inf. 31, No. 2, 3-19 (1995; Zbl 0901.94018)]\ the authors and \textit{P. Narayan} introduced the list-of-\(L\) decoding algorithm for a deterministic code: the context was transmission over an arbitrarily varying channel (AVC). In that work necessary and sufficient conditions for a list capacity \(C_L\) to coincide with the random code capacity \(C\) under the average probability of error criterion were obtained. In this paper we obtain an estimation on the volume \(L\) of the list for which \(C_{L} = C\). The list-of-\(L\) decoding algorithm consists in the first step of an algorithm taken from \textit{I. Csiszar} and \textit{P. Narayan} [IEEE Trans. Inf. Theory 34, No. 2, 181-193 (1988; Zbl 0652.94005)]. For the entire collection see [Zbl 0866.00068].