Rudolf Ahlswede
Rudolf F. Ahlswede (15 September 1938 – 18 December 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.
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 2006 Claude E. Shannon Award, one of the first few non-US citizens to receive it. Ahlswede's work began the field of Network coding.[1]
Rudolf Ahlswede died on 18 December 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.
- http://www.mathematik.uni-bielefeld.de/ahlswede/books/kluwer.html
- 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.
- http://www.springer.com/computer/foundations/book/978-3-540-46244-6
- 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.
- http://www.springer.com/math/numbers/book/978-3-540-78601-6
See also
- Ahlswede–Daykin inequality
- Information-theoretic security
- Linear network coding
References
- ^ 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
- http://www.mathematik.uni-bielefeld.de/ahlswede/
- http://www.math.uni-bielefeld.de/ahlswede/homepage/
- http://media.itsoc.org/isit2006/ahlswede/
External links
- Rudolf Ahlswede at the Mathematics Genealogy Project
- v
- t
- e
- 1972 Claude E. Shannon
- 1973
- 1974 David S. Slepian
- 1975
- 1976 Robert M. Fano
- 1977 Peter Elias
- 1978 Mark Semenovich Pinsker
- 1979 Jacob Wolfowitz
- 1980
- 1981 W. Wesley Peterson
- 1982 Irving S. Reed
- 1983 Robert G. Gallager
- 1984
- 1985 Solomon W. Golomb
- 1986 William Lucas Root
- 1987
- 1988 James Massey
- 1989
- 1990 Thomas M. Cover
- 1991 Andrew Viterbi
- 1992
- 1993 Elwyn Berlekamp
- 1994 Aaron D. Wyner
- 1995 George David Forney
- 1996 Imre Csiszár
- 1997 Jacob Ziv
- 1998 Neil Sloane
- 1999 Tadao Kasami
- 2000 Thomas Kailath
- 2001 Jack Keil Wolf
- 2002 Toby Berger
- 2003 Lloyd R. Welch
- 2004 Robert McEliece
- 2005 Richard Blahut
- 2006 Rudolf Ahlswede
- 2007 Sergio Verdú
- 2008 Robert M. Gray
- 2009 Jorma Rissanen
- 2010 Te Sun Han
- 2011 Shlomo Shamai (Shitz)
- 2012 Abbas El Gamal
- 2013 Katalin Marton
- 2014 János Körner
- 2015 Robert Calderbank
- 2016 Alexander Holevo
- 2017 David Tse
- 2018 Gottfried Ungerboeck
- 2019 Erdal Arıkan
- 2020 Charles Bennett
- 2021 Alon Orlitsky
- 2022 Raymond W. Yeung
- 2023 Rüdiger Urbanke
- 2024 Andrew Barron