Rudolf Ahlswede
Rudolf Ahlswede was a German mathematician whose information theory and network-coding work helps explain the data movement behind networked AI. He studied mathematics, physics, and philosophy, completed a Göttingen doctorate in 1966, and published on channel coding in 1967. At Bielefeld, he became a professor and dean, then coauthored the 1979 search book “Suchprobleme” with Ingo Wegener. His IEEE Information Theory Society paper awards came in 1988 and 1990; his 2000 “Network information flow” paper explains coding inside networks, he received the Claude E. Shannon Award in 2006, and he died in 2010.
Timeline
-
1938–1967
A doctorate in information theory
Born in Dielmissen in 1938, he studies mathematics, physics, and philosophy, then completes a University of Göttingen doctorate in 1966 on Shannon information theory for non-stationary channels. In 1967, he publishes “Certain results in coding theory for compound channels.”
-
1977
Professor and faculty dean
He joins Bielefeld University as a professor and serves as dean of its mathematics faculty in 1977.
-
1979
A book on search problems
He publishes “Suchprobleme” with Ingo Wegener in 1979.
-
1988
An award for hypothesis testing
He shares the IEEE Information Theory Society Best Paper Award with Imre Csiszár in 1988 for work on hypothesis testing.
-
1990
An award for message identification
He shares the IEEE Information Theory Society Best Paper Award with Gunter Dueck in 1990 for work on message identification.
-
2000
Network information flow
With Ning Cai, Shuo Yen Robert Li, and Raymond W. Yeung, he publishes “Network information flow” in 2000. The paper presents network coding, in which nodes combine information, and shows how this can save bandwidth.
-
2006
The Claude E. Shannon Award
He receives the Claude E. Shannon Award in 2006.
-
2010
Death in Polle
He dies in Polle in 2010.
Sources and credits
Photo: We have no published photo of Rudolf Ahlswede yet. Send us a free-licensed photo.