Skip to main content
SpringerLink
Log in
Book cover

Probabilistic Methods and Distributed Information pp 23–37Cite as

Elimination and Robustification Techniques

  • Chapter
  • First Online:

  • 618 Accesses

Part of the book series: Foundations in Signal Processing, Communications and Networking ((SIGNAL,volume 15))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. R. Ahlswede, Elimination of correlation in random codes for arbitrarily varying channels. Z. Wahrscheinlichkeitstheorie Verw. Gebiete 33, 159–175 (1978)

    Google Scholar 

  2. R. Ahlswede, N. Cai, Two proofs of Pinsker’s conjecture concerning arbitrarily varying channels. IEEE Trans. Inform. Theory 37, 1647–1649 (1991)

    Article  MathSciNet  Google Scholar 

  3. R. Ahlswede, Arbitrarily varying channels with states sequence known to the sender. IEEE Trans. Inform. Theory 32, 621–629 (1986)

    Article  MathSciNet  Google Scholar 

  4. J.-H. Jahn, Coding of arbitrarily varying multiuser channels. IEEE Trans. Inform. Theory 27, 212–226 (1981)

    Article  MathSciNet  Google Scholar 

  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–52

    Google Scholar 

  6. S.I. Gelfand, M.S. Pinsker, Coding for channel with random parameters. Prob. Control Inform. Theory 9, 19–31 (1980)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bielefeld, Germany

    Rudolf Ahlswede

Authors
  1. Rudolf Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rudolf Ahlswede .

Editor information

Editors and Affiliations

  1. Bielefeld, Germany

    Alexander Ahlswede

  2. Faculty of Mathematics and Computer Sciences, Friedrich-Schiller-University Jena, Jena, Germany

    Ingo Althöfer

  3. Institute for Communications Engineering, Technical University of Munich, München, Bayern, Germany

    Christian Deppe

  4. Applied Mathematics and Statistics, Quantitative Methods, Bielefeld University of Applied Sciences, Bielefeld, Germany

    Ulrich Tamm

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ahlswede, R. (2019). Elimination and Robustification Techniques. In: Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (eds) Probabilistic Methods and Distributed Information. Foundations in Signal Processing, Communications and Networking, vol 15. Springer, Cham. https://doi.org/10.1007/978-3-030-00312-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00312-8_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00310-4

  • Online ISBN: 978-3-030-00312-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation