Comparison of Channels: Criteria for Domination by a Symmetric Channel

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 ${\chi }^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.

31 pages, 2 figures. Presented at 2017 IEEE International Symposium on Information Theory (ISIT)

Cited by in corpus (15)

• A Novel Approach to the Partial Information Decomposition
• Coding Theorems for Noisy Permutation Channels
• On contraction coefficients, partial orders and approximation of capacities for quantum channels
• Coding for Positive Rate in the Source Model Key Agreement Problem
• On Relations Between the Relative entropy and ${\chi }^2$-Divergence, Generalizations and Applications
• On Data-Processing and Majorization Inequalities for $f$-Divergences with Applications
• Partial Information Decomposition via Deficiency for Multivariate Gaussians
• Low density majority codes and the problem of graceful degradation
• Application of information-percolation method to reconstruction problems on graphs
• Doeblin Coefficients and Related Measures
• Non-linear Log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems
• Broadcasting on trees near criticality
• Almost-Reed--Muller Codes Achieve Constant Rates for Random Errors
• Reverse-type Data Processing Inequality
• A Distance Between Channels: the average error of mismatched channels