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


Published in:
IEEE Transactions on Information Theory, 43, 6, 1977-1982
Year:
1997
Laboratories:




 Record created 2008-08-08, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)