Rudolf Ahlswede

Rudolf Ahlswede ( born September 15, 1938 in Dielmissen, † December 18, 2010 in Polle ) was a German mathematician.

Ahlswede his doctorate in 1966 in Goettingen Konrad Jacobs with the subject "Contributions to Shannon information theory, in the case of non-stationary channels ." He also devoted himself in his further career information theory and was one of the leading representatives of this area.

In 1988 he received along with Imre Csiszar the Prize Paper Award of the IEEE Information Theory Society for work in the area of hypothesis testing and in 1990 for a new theory of message identification. He was thus one of currently four scientists, which this prize was awarded twice.

As a professor emeritus at the University of Bielefeld Ahlswede received the 2006 Claude Elwood Shannon - Award of the IEEE Information Theory Society. The award is named after Claude Elwood Shannon and is awarded for outstanding achievements in the field of information theory since 1974. The price was only five times to goods not originating in the United States scientists.

Writings

  • R. Ahlswede and I. Wegener: search problems. Teubner Verlag, Stuttgart 1979, Russian version with an appendix of Maljutov 1981.
  • R. Ahlswede and I. Wegener: Search problem. English Edition of " search problems " with Supplement of recent literature, RL Graham, JK Lenstra, and RE Tarjan (Eds.): Wiley- Interscience Series in Discrete Mathematics and Optimization. In 1987.
  • I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, MS Pinsker, A. Sarkozy, I. Wegener and Z. Zhang (Eds.): Numbers, Information and Complexity, 50 articles in honor of Rudolf Ahlswede. Kluwer Academic Publishers, Boston, 2000.
  • R. Ahlswede, L. Bäumer, N. Cai, H. Aydinian, V. Blinovsky, C. Deppe, and H. Mashurian (Eds.): General Theory of Information Transfer and Combinatorics, Lecture Notes in Computer Science vol. 4123rd Springer -Verlag, 2006.
  • R. Ahlswede, L. Bäumer, N. Cai and (Eds.): General Theory of Information Transfer and Combinatorics. Discrete Applied Mathematics, Volume 156, Issue 9, 2008.
  • R. Ahlswede and V. Blinovsky: Lectures on Advances in Combinatorics. Universitext, Springer- Verlag, 2008, ISBN 978-3-540-78601-6.

Some essays:

  • Contributions to Shannon information theory, in the case of non-stationary channels, Z. Probability Theory and Related Fields, Volume 10.1968, p 1-42 (dissertation)
  • An elementary proof of the strong converse theorem for the multiple- access channel, Journal of Combinatorics, Volume 7, 1982, 216-230
  • The capacity region of a channel with two senders and two receivers, Annals of Probability, Volume 2, 1973, p 805-814
  • With Peter Gács, Janos grains Bounds on conditional probabilities with applications in multi-user communication, Z. Probability Theory and Related Fields, Volume 34, 1976, 157-177
Claude E. Shannon Award Ingo Wegener Ronald Graham Mathematics Genealogy Project Integrated Authority File
35601
de