A Wringing Method: An Elementary Proof of the Strong Converse Theorem for Multiple-Access Channels
The methods of the analysis of the multiple description problem described in this chapter essentially use the methods developed for multiple-access channels (MACs). One of these methods concern the strong converse theorem which was proved by Dueck  in the sense of Wolfowitz  using the Ahlswede-Gács-Körner  method of “blowing up decoding sets” in conjunction with a new “wringing technique”. We will present the results of  where this theorem was proved without using the method of “blowing up decoding sets”, and considerations are based on non-elementary combinatorial work of Margulis .
- 6.R. Ahlswede, On two-way communication channels and a problem by Zarankiewics. in Transactions 6-th Prague Conference on Information Theory, Sept. 1971 (Publishing House of the Czechoslovakian Academy of Sciences, 1974), pp. 23–37Google Scholar
- 8.R. Ahlswede, Multi–way communication channels. in 2nd International Symposium on Information Theory, Thakadsor, 1971 (Publishing House of the Hungarian Academy of Sciences, 1973), p. 23–52Google Scholar
- 9.U. Augustin, Gedächtnisfreie Kanäle für diskrete Zeit. Z. Wahrscheinlichkeitstheorie u. verw. Gebiete 6, 10–61 (1966)Google Scholar
- 11.J.H.B. Kemperman, Studies in Coding Theory I, Mimeo graphed lecture notes (1961)Google Scholar
- 12.K. Zarankiewicz, Problem P 101. Golloq. Math. 2, 301 (1951)Google Scholar