|
|
|
|
LEADER |
01855 am a22002053u 4500 |
001 |
124302 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Makur, Anuran
|e author
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
700 |
1 |
0 |
|a Polyanskiy, Yury
|e author
|
245 |
0 |
0 |
|a Comparison of channels: criteria for domination by a symmetric channel
|
260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2020-03-24T21:20:44Z.
|
856 |
|
|
|z Get fulltext
|u https://hdl.handle.net/1721.1/124302
|
520 |
|
|
|a 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 χ²-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. ©2018 Keywords: less noisy; degradation; q-ary symmetric channel; additive noise channel; Dirichlet form; logarithmic Sobolev inequalities
|
520 |
|
|
|a National Science Foundation CAREER Award (CCF-12-53205)
|
520 |
|
|
|a Center for Science of Information (National Science Foundation) (Grant agreement CCF-09-39370)
|
546 |
|
|
|a en
|
655 |
7 |
|
|a Article
|
773 |
|
|
|t 10.1109/TIT.2018.2839743
|
773 |
|
|
|t IEEE Transactions on Information Theory
|