We consider the one helper source coding problem posed and investigated by Ahlswede, K & ouml;rner, and Wyner for a class of information sources with memory. For this class of information sources we give explicit ...
详细信息
We consider the one helper source coding problem posed and investigated by Ahlswede, K & ouml;rner, and Wyner for a class of information sources with memory. For this class of information sources we give explicit inner and outer bounds of the admissible rate region. We also give a certain nontrivial class of information sources where the inner and outer bounds match.
Let X, Y be two correlated discrete random variables. We consider an estimation of X from encoded data phi(Y) of Y by some encoder function phi Y). We derive an inequality describing a relation of the correct probabil...
详细信息
Let X, Y be two correlated discrete random variables. We consider an estimation of X from encoded data phi(Y) of Y by some encoder function phi Y). We derive an inequality describing a relation of the correct probability of estimation and the mutual information between X and phi(Y). This inequality may be useful for the secure analysis of crypto system when we use the success probability of estimating secret data as a security criterion. It also provides an intuitive meaning of the secrecy exponent in the strong secrecy criterion.
暂无评论