Comparison of Channels: Criteria for Domination by a Symmetric Channel
Comparison of Channels: Criteria for Domination by a Symmetric Channel
复制标题
渠道比较:对称渠道统治的标准
DOI:
--
复制
发表时间:
2016
影响因子:
2.5
通讯作者:
Yury Polyanskiy
中科院分区:
文献类型:
--
作者:
A. Makur;Yury Polyanskiy
This paper studies the basic question of whether a given channel <inline-formula> <tex-math notation="LaTeX">$V$ </tex-math></inline-formula> can be dominated (in the precise sense of being more noisy) by a <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>-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 <inline-formula> <tex-math notation="LaTeX">$chi ^{2}$ </tex-math></inline-formula>-divergence. Furthermore, we develop a simple criterion for domination by a <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>-ary symmetric channel in terms of the minimum entry of the stochastic matrix defining the channel <inline-formula> <tex-math notation="LaTeX">$V$ </tex-math></inline-formula>. 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.