Rudolf Ahlswede

from Wikipedia, the free encyclopedia
Rudolf Ahlswede (1971)

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

Ahlswede received his doctorate in 1966 in Göttingen under Konrad Jacobs with the topic "Contributions to Shannon's information theory in the case of non-stationary channels". He devoted himself to information theory in his further career and was one of the world's leading exponents in this field.

In 1988 he and Imre Csiszar received the Prize Paper Award from the IEEE Information Theory Society for a thesis in the field of hypothesis testing and in 1990 with Gunter Dueck for a new theory of message identification. He was thus one of the current four scientists who have been awarded this prize twice.

As a professor emeritus at Bielefeld University , Ahlswede received the 2006 Claude Elwood Shannon Award from the IEEE Information Theory Society. The award is named after Claude Elwood Shannon and has been awarded since 1974 for outstanding achievements in the field of information theory. The award went only five times to non-US scientists.

Fonts

  • R. Ahlswede and I. Wegener : Search problems . Teubner Verlag, Stuttgart 1979, Russian version with an appendix by Maljutov 1981.
  • R. Ahlswede and I. Wegener: Search Problems . English Edition of "Suchprobleme" with Supplement of recent literature, RL Graham , JK Lenstra, and RE Tarjan (Eds.): Wiley-Interscience Series in Discrete Mathematics and Optimization . 1987.
  • I. Althöfer , N. Cai, G. Dueck, L. Khachatrian, MS Pinsker, A. Sárkozy, I. Wegener and Z. Zhang (Eds.): Numbers, Information and Complexity, 50 articles in honor of Rudolf Ahlswede . Kluwer Academic Publishers, Boston 2000. [1]
  • 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. 4123 . Springer-Verlag, 2006. [2]
  • R. Ahlswede, L. Bäumer, and N. Cai (Eds.): General Theory of Information Transfer and Combinatorics . Discrete Applied Mathematics, Volume 156, Issue 9, 2008. [3]
  • R. Ahlswede and V. Blinovsky: Lectures on Advances in Combinatorics . Universitext, Springer-Verlag, 2008, ISBN 978-3-540-78601-6 . [4]

Some essays:

  • Contributions to Shannon's information theory in the case of non-stationary channels, Z. Probability Theory and Related Areas, Volume 10.1968, pp. 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, pp. 805-814
  • with Peter Gács, Janos Körner Bounds on conditional probabilities with applications in multiuser communication , Z. Probability Theory and Related Fields, Volume 34, 1976, 157–177

Individual evidence

  1. Homepage, Bielefeld University
  2. ^ Rudolf Ahlswede in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used

Web links