...
首页> 外文期刊>電子情報通信学会技術研究報告. 情報セキュリティ. Information Security >On the Generalization of Fano's Inequality for Countably Infinite Alphabets, List-Decoding, and General Conditional Information Measures
【24h】

On the Generalization of Fano's Inequality for Countably Infinite Alphabets, List-Decoding, and General Conditional Information Measures

机译:On the Generalization of Fano's Inequality for Countably Infinite Alphabets, List-Decoding, and General Conditional Information Measures

获取原文
获取原文并翻译 | 示例
           

摘要

Analogues of Fano's inequality are investigated under the following settings: Firstly, the alphabet X of a discrete random variable X is allowed to be countably infinite. Secondly, instead of a fixed finite cardinality X, a fixed X-marginal distribution is given. Thirdly, information measures are generalized from the conditional Shannon entropy H{X Y) to a general type of conditional information measures without explicit form, which contains Arimoto's and Hayashi's conditional Renyi entropies. And fourthly, the average probability of error is defined on list-decoding settings. The main results of this study are tight upper bounds on the generalized conditional information measures for given (i) an X-marginal distribution; (ii) a size of fist-decoding; and (iii) a tolerated probability of error. Our Fano-type inequalities are formalized by specific discrete probability distributions. Sufficient conditions of the sharpness of our Fano-type inequalities are then also clarified on the cardinality of the alphabet Y of a side information Y of X. Technical details of this study can be found in 18.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号