Converse proof for random coding capacity of AVC I want to see the converse proof for the random coding (shared randomness) capacity of AVC. All I can find online is Csiszar Narayan's AVC paper which looks at deterministic coding. Further, the proof itself is quite dense (using Lemma 2 in the paper).
I am wondering if there is any work that proves the converse of AVC random coding capacity (shared randomness). If anyone can write the proof here then that works as well. I am ok with a proof for deterministic coding capacity of AVC as well if it is different from the above-mentioned paper.
A complete proof appears in Blackwell, Breiman and Thomasian, The Capacities of Certain Channel Classes Under Random Coding. This paper is linked from the Wikipedia article on AVCs.