Comparison of Channels: Criteria for Domination by a Symmetric Channel

DOI10.1109/TIT.2018.2839743MaRDI QIDQ4682871zbMATH OpenOpenAlexWikidataFDO

Authors Anuran Makur, Yury Polyanskiy

Publication date 19 September 2018

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

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

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probabilistic potential theory (60J45) Statistical aspects of information-theoretic topics (62B10) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Abstract: This paper studies the basic question of whether a given channel $V$ can be dominated (in the precise sense of being more noisy) by a $q$-ary symmetric channel. The concept of "less noisy" relation between channels originated in network information theory (broadcast channels) and is defined in terms of mutual information or Kullback-Leibler divergence. We provide an equivalent characterization in terms of $ch{i}^2$-divergence. Furthermore, we develop a simple criterion for domination by a $q$-ary symmetric channel in terms of the minimum entry of the stochastic matrix defining the channel $V$. The criterion is strengthened for the special case of additive noise channels over finite Abelian groups. Finally, it is shown that domination by a symmetric channel implies (via comparison of Dirichlet forms) a logarithmic Sobolev inequality for the original channel.

Recommendations

• Capacity of Two-Way Channels With Symmetry Properties
• A note on equivalent comparisons of information channels
• On the Characteristic Graph of a Discrete Symmetric Channel
• On Broadcast Channels With Binary Inputs and Symmetric Outputs
• A combinatorial lemma and Shannon's theorem for binary symmetric channels
• Wiretap Channels: Implications of the More Capable Condition and Cyclic Shift Symmetry
• Matched Metrics to the Binary Asymmetric Channels
• scientific article; zbMATH DE number 4184186
• On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels
• Equivalent comparisons of information channels

Cited in

(6)

• A distance between channels: the average error of mismatched channels
• Application of the information-percolation method to reconstruction problems on graphs
• On the Characteristic Graph of a Discrete Symmetric Channel
• Non-linear log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems
• Reverse-type data processing inequality
• Comparison of contraction coefficients for f-divergences

This page was built for publication: Comparison of Channels: Criteria for Domination by a Symmetric Channel

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