Elimination and Robustification Techniques

  • Rudolf AhlswedeEmail author
Part of the Foundations in Signal Processing, Communications and Networking book series (SIGNAL, volume 15)


The elimination technique was introduced in [1], who used it to prove the coding theorem of the AVC, which is that the capacity of an AVC with average probability of error is either zero or the random code capacity. It is called Dichotomy theorem, named after its dramatic form.


  1. 1.
    R. Ahlswede, Elimination of correlation in random codes for arbitrarily varying channels. Z. Wahrscheinlichkeitstheorie Verw. Gebiete 33, 159–175 (1978)Google Scholar
  2. 2.
    R. Ahlswede, N. Cai, Two proofs of Pinsker’s conjecture concerning arbitrarily varying channels. IEEE Trans. Inform. Theory 37, 1647–1649 (1991)MathSciNetCrossRefGoogle Scholar
  3. 3.
    R. Ahlswede, Arbitrarily varying channels with states sequence known to the sender. IEEE Trans. Inform. Theory 32, 621–629 (1986)MathSciNetCrossRefGoogle Scholar
  4. 4.
    J.-H. Jahn, Coding of arbitrarily varying multiuser channels. IEEE Trans. Inform. Theory 27, 212–226 (1981)MathSciNetCrossRefGoogle Scholar
  5. 5.
    R. Ahlswede, Multi–way communication channels,in Proceedings of 2nd International Symposium on Information Theory, Thakadsor, Armenian 1971 (Akademiai Kiado Budapest, 1973), pp. 23–52Google Scholar
  6. 6.
    S.I. Gelfand, M.S. Pinsker, Coding for channel with random parameters. Prob. Control Inform. Theory 9, 19–31 (1980)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.BielefeldGermany

Personalised recommendations