Zero-error list capacities of discrete memoryless channels

We define zero-error list capacities for discrete memoryless channels. We find lower bounds to, and a characterization of, these capacities. As is usual for such zero-error problems in information theory, the characterization is not generally a single-letter one. Nonetheless, we exhibit a class of channels for which a single letter characterization exists. We also show how the computational cutoff rate relates to the capacities we have defined