On the outage capacity of a practical decoder accounting for channel estimation inaccuracies
IEEE Transactions on Communications
On the duality between Slepian-Wolf coding and channel coding under mismatched decoding
IEEE Transactions on Information Theory
Outage behavior of discrete memoryless channels under channel estimation errors
IEEE Transactions on Information Theory
Linear universal decoding for compound channels
IEEE Transactions on Information Theory
Hi-index | 755.02 |
For discrete memoryless channels {W: X→Y} we consider decoders, possibly suboptimal, which minimize a metric defined additively by a given function d(x, y)⩾0. The largest rate achievable by codes with such a decoder is called the d-capacity Cd (W). The choice d(x, y)=0 if and only if (iff) W(y|x)>0 makes C d(W) equal to the “zero undetected error” or “erasures-only” capacity Ceo(W). The graph-theoretic concepts of Shannon capacity (1956, 1974) and Sperner capacity are also special cases of d-capacity, viz. for a noiseless channel with a suitable {0, 1}-valued function d. We show that the lower bound on d-capacity given previously by Csiszar and Korner (1980), and Hui (1983), is not tight in general, but Cd(W)>0 iff this bound is positive. The “product space” improvement of the lower bound is considered,and a “product space characterization” of Ceo(W) is obtained. We also determine the erasures-only (e.o.) capacity of a deterministic arbitrarily varying channel defined by a bipartite graph, and show that it equals capacity. We conclude with a list of challenging open problems