Strong coding theorem and asymptotic error exponent of arbitrarily varying source ith a fidelity criterion

摘要

When the error probability is less than 2~-πr, the minimum compression rate (r-optimal rate) of arbitrarily varying source with a fidelity criterion is determined. This generalizes the result of Arutyunyan and Mekaush~[1] for discrete memory less source with a fidelity criterion, and is called strong coding theorem of arbitrarily varying source with a fidelity criterion. We also determine the asymptotic error exponent for arbitrarily var- ing source with a fidelity criterion. This generalizes Marton's result in [2] for discrete memoryless source with a fidelity criterion.