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.展开更多
文摘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.
