Less Noisy Domination By Symmetric Channels

2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)(2017)

引用 6|浏览20
暂无评分
摘要
Consider the family of all q-ary symmetric channels (q-SCs) with capacities decreasing from log (q) to 0. This paper addresses the following question: what is the member of this family with the smallest capacity that dominates a given channel V in the "less noisy" preorder sense. When the qnSCs are replaced by q-ary erasure channels, this question is known as the "strong data processing inequality." We provide several equivalent characterizations of the less noisy preorder in terms of x(2)-divergence, Lowner (PSD) partial order, and spectral radius. We then illustrate a simple criterion for domination by a q-SC based on degradation, and mention special improvements for the case where 17 is an additive noise channel over an Abelian group of order q. Finally, as an application, we discuss how logarithmic Sobolev inequalities for q-SCs, which are well-studied, can be transported to an arbitrary channel V.
更多
查看译文
关键词
less noisy domination,symmetric channels,less noisy preorder sense,q-ary erasure channels,strong data processing inequality,equivalent characterizations,divergence,Löwner partial order,spectral radius,additive noise channel,Abelian group,logarithmic Sobolev inequalities,q-SCs,arbitrary channel
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要