The mismatch capacity under stochastic decoding equals the supremum over input distribution sequences of the limit inferior in probability of the normalized mismatched information densities, with the limit of expectations serving as an achievable upper bound for discrete memoryless channels with a C
The generalized stochastic likelihood decoder: Random coding and expurgated bounds
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2verdicts
UNVERDICTED 2representative citing papers
Establishes exact error and strong converse exponents for IB source coding via matching bounds and links it operationally to the Wyner-Ahlswede-Körner problem.
citing papers explorer
-
Mismatch Capacity under Stochastic Decoding
The mismatch capacity under stochastic decoding equals the supremum over input distribution sequences of the limit inferior in probability of the normalized mismatched information densities, with the limit of expectations serving as an achievable upper bound for discrete memoryless channels with a C
-
Exponential Error Bounds for Information Bottleneck Source Coding Problems
Establishes exact error and strong converse exponents for IB source coding via matching bounds and links it operationally to the Wyner-Ahlswede-Körner problem.