Rudolf Ahlswede

Rudolf F. Ahlswede (September 15, 1938 – December 18, 2010) was a German mathematician. Born in Dielmissen, Germany, he studied mathematics, physics, and philosophy. He wrote his Ph.D. thesis in 1966, at the University of Göttingen, with the topic "Contributions to the Shannon information theory in case of non-stationary channels". He dedicated himself in his further career to information theory and became one of the leading representatives of this area worldwide.

Rudolf Ahlswede

Life and work

In 1977, he joined and held a Professorship at the University of Bielefeld, Bielefeld, Germany. In 1988, he received together with Imre Csiszár the Best Paper Award of the IEEE Information Theory Society for work in the area of the hypothesis testing as well as in 1990 together with Gunter Dueck for a new theory of message identification. He has been awarded this prize twice. As an emeritus of Bielefeld University, Ahlswede received the Claude Elwood Shannon Award 2006 of the IEEE information Theory Society. The prize is designated after Claude Elwood Shannon and since 1974 for outstanding achievements in the area of the information theory. The prize went only five times to scientists from outside the USA. This is the beginning of a new theory known as Network coding.[1]

Rudolf Ahlswede died on December 18, 2010, at the age of 72.

Books
  • R. Ahlswede and I. Wegener, Suchprobleme, Teubner Verlag, Stuttgart, 1979.
  • R. Ahlswede and I. Wegener, Search Problems, English Edition of "Suchprobleme" with Supplement of recent Literature,
  • R.L. Graham, J.K. Leenstra, and R.E. Tarjan (Eds.), Wiley-Interscience Series in Discrete Mathematics and Optimization, 1987.
  • I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M.S. Pinsker, A. Sárkozy, I. Wegener and Z. Zhang (Eds.),Numbers, Information and Complexity, 50 articles in honour 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, Springer-Verlag, Vol. 4123, 2006.
  • Ahlswede, Rudolf (2008). "General theory of information transfer: Updated". Discrete Applied Mathematics. 156 (9): 1348–1388. doi:10.1016/j.dam.2007.07.007.
  • R. Ahlswede and V. Blinovsky, Lectures on Advances in Combinatorics, Universitext, Springer-Verlag, 2008.

References
  1. Ahlswede, R; Ning Cai; Li, S.-Y.R; Yeung, R.W (2000). "Network information flow" (PDF). IEEE Transactions on Information Theory. 46 (4): 1204–1216. CiteSeerX 10.1.1.722.1409. doi:10.1109/18.850663.

Sources
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.