Lower bound on error probability in fixed-volume list decoding (Q1190024)

A lower bound for the error probability in list decoding with fixed list capacity \(L\) is obtained. A discrete, symmetric and memoryless channel model with symbol error probability \(p\) is assumed. A bound for code rate streaming to null and code vector length streaming to infinity is given. In the rather long proof standard algebraic methods are used.