Part of the Foundations in Signal Processing, Communications and Networking book series (SIGNAL, volume 15)
There are two important methods for the proof of the coding theorem for the AVC. One is the elimination (and robustification) technique in Sect. 5.3.
- 3.R. Ahlswede, Storing and Transmitting Data, Rudolf Ahlswede’s Lectures on Information Theory 1, editors A. Ahlswede, I. Althöfer, C. Deppe and U. Tamm, Series: Foundations in Signal Processing, Communications and Networking, Vol. 10, Springer-Verlag (2014)Google Scholar
- 4.R. Ahlswede, Coloring hypergraphs, a new approach to multi–user source coding, J. Comb. Inform. & System Sci., –I, Vol. 4, 76–115, 1979 and -II, Vol. 5, 220–268 (1980)Google Scholar
- 6.V.M. Blinovsky, O. Narayan and M.S. Pinsker, Capacity of the arbitrarily varying channel under list decoding, Prob. Inform. Transmis., Vol. 31, 99–113, 1995, translated from Problemy Peredačii Informacii, Vol. 31, No. 2, 3–19 (1995)Google Scholar
© Springer Nature Switzerland AG 2019