Erasure, list, and detection zero-error capacities for low noise and a relation to identification

For the discrete memoryless channel (X ;Y;W ) we give characterisations of the zero{ error erasure capacity Cer and the zero{error average list size capacity Ca` in terms of limits of suitable information resp. divergence quantities (Theorem 1). However, they don't \single{letterize". Next we assume that X Y and W (xjx) > 0 for all x 2 X , and we associate… CONTINUE READING