When the error probability is less than 2--"", the minimum compression rate(r-optimal rate) of arbitrarily varying source with a fidelity criterion is determined. Thisgeneralizes the result of Arutyunyan and...When the error probability is less than 2--"", the minimum compression rate(r-optimal rate) of arbitrarily varying source with a fidelity criterion is determined. Thisgeneralizes the result of Arutyunyan and Mekaushll] for discrete memoryless source witha fidelity criterion, and is called strong coding theorem of arbitrarily varying source witha fidelity criterion. We also determine the asymptotic error exponellt for arbitrarily varying source with a fidelity criterion. This generalizes Marton’s result in [2] for discretememoryless source with a fidelity criterion.展开更多
Csiszar's strong coding theorem for discrete memoryless scarce is generalized to arbitrarily varying source.We also determine the asymptotic error exponent for arbitrarily wrying source.
Hypothesis testing for arbitrarily varying source (AVS), which is to decide between the two hypotheses for the varying behavior of the distribution of AVS, is considered in this paper. We determine the best asymptotic...Hypothesis testing for arbitrarily varying source (AVS), which is to decide between the two hypotheses for the varying behavior of the distribution of AVS, is considered in this paper. We determine the best asymptotic exponent of the second kind of error probability when the first kind of error probability is fixed. This result generalizes the well-known lemma of Stein in statistics. As a corollary, Strassen’s coding theorem for AVS is obtained.展开更多
文摘When the error probability is less than 2--"", the minimum compression rate(r-optimal rate) of arbitrarily varying source with a fidelity criterion is determined. Thisgeneralizes the result of Arutyunyan and Mekaushll] for discrete memoryless source witha fidelity criterion, and is called strong coding theorem of arbitrarily varying source witha fidelity criterion. We also determine the asymptotic error exponellt for arbitrarily varying source with a fidelity criterion. This generalizes Marton’s result in [2] for discretememoryless source with a fidelity criterion.
文摘Csiszar's strong coding theorem for discrete memoryless scarce is generalized to arbitrarily varying source.We also determine the asymptotic error exponent for arbitrarily wrying source.
基金Supported by the Young Teacher Foundation of Chinese Educational Ministry and by the National Natural Science Foundation of China.
文摘Hypothesis testing for arbitrarily varying source (AVS), which is to decide between the two hypotheses for the varying behavior of the distribution of AVS, is considered in this paper. We determine the best asymptotic exponent of the second kind of error probability when the first kind of error probability is fixed. This result generalizes the well-known lemma of Stein in statistics. As a corollary, Strassen’s coding theorem for AVS is obtained.
