A General Formula for the Mismatch Capacity

DOI10.1109/TIT.2015.2449856MaRDI QIDQ2977258zbMATH OpenOpenAlexFDO

Authors Anelia Somekh-Baruch

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.7964

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Abstract: The fundamental limits of channels with mismatched decoding are addressed. A general formula is established for the mismatch capacity of a general channel, defined as a sequence of conditional distributions with a general decoding metrics sequence. We deduce an identity between the Verd'{u}-Han general channel capacity formula, and the mismatch capacity formula applied to Maximum Likelihood decoding metric. Further, several upper bounds on the capacity are provided, and a simpler expression for a lower bound is derived for the case of a non-negative decoding metric. The general formula is specialized to the case of finite input and output alphabet channels with a type-dependent metric. The closely related problem of threshold mismatched decoding is also studied, and a general expression for the threshold mismatch capacity is obtained. As an example of threshold mismatch capacity, we state a general expression for the erasures-only capacity of the finite input and output alphabet channel. We observe that for every channel there exists a (matched) threshold decoder which is capacity achieving. Additionally, necessary and sufficient conditions are stated for a channel to have a strong converse. Csisz'{a}r and Narayan's conjecture is proved for bounded metrics, providing a positive answer to the open problem introduced in [1], i.e., that the "product-space" improvement of the lower random coding bound, $C_q^{(infty)}(W)$, is indeed the mismatch capacity of the discrete memoryless channel $W$. We conclude by presenting an identity between the threshold capacity and $C_q^{(infty)}(W)$ in the DMC case.

Recommendations

• A general formula for channel capacity
• A General Formula for Compound Channel Capacity
• Capacity of the mismatched Gaussian channel
• The coding capacity of mismatched Gaussian channels (Corresp.)
• A Single-Letter Upper Bound to the Mismatch Capacity
• A general formula for the capacity of stationary nonanticipatory channels
• On the capacity of a class of mismatched Gaussian channels (Corresp.)
• Capacity of mismatched Gaussian channels with and without feedback
• On Achievable Rates and Error Exponents for Channels With Mismatched Decoding
• scientific article; zbMATH DE number 4213904

This page was built for publication: A General Formula for the Mismatch Capacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977258)