2006 - IEEE Claude E. Shannon Award
Rudolf Ahlswede focuses on Discrete mathematics, Combinatorics, Information theory, Communication channel and Channel capacity. In general Discrete mathematics, his work in Complete intersection is often linked to Mathematical finance linking many areas of study. His Combinatorics research focuses on subjects like Hamming code, which are linked to Perfect power.
His Information theory research is multidisciplinary, relying on both Entropy, Theoretical computer science and Cryptography. His Theoretical computer science study combines topics from a wide range of disciplines, such as Statistics, Conditional probability distribution and Conditional mutual information. His Channel capacity research includes themes of Shannon–Fano coding, Channel code, Decoding methods, Distributed source coding and Computer network.
His scientific interests lie mostly in Discrete mathematics, Combinatorics, Information theory, Algorithm and Communication channel. His Discrete mathematics course of study focuses on Linear code and Concatenated error correction code. His Combinatorics research is multidisciplinary, incorporating perspectives in Hamming code and Finite set.
Rudolf Ahlswede has included themes like Theoretical computer science, Data compression, Converse, Entropy and Channel capacity in his Information theory study. Algorithm is frequently linked to Coding in his study. His Communication channel research incorporates themes from Transmission and Topology.
His primary areas of study are Combinatorics, Discrete mathematics, Coding, Upper and lower bounds and Information theory. His studies in Combinatorics integrate themes in fields like Intersection and Finite set. His Discrete mathematics study incorporates themes from Amplitude damping channel, Quantum capacity, Algebra and Decoding methods, Coding theorem.
In his study, Graph theory is inextricably linked to Bipartite graph, which falls within the broad field of Coding. His Information theory research is multidisciplinary, incorporating elements of Mathematical theory, Mathematical economics, Data compression, Artificial intelligence and Mathematical statistics. His biological study spans a wide range of topics, including Random variable, Cryptography, Convergence, Secrecy and Value.
His main research concerns Combinatorics, Discrete mathematics, Upper and lower bounds, Coding and Group testing. His Combinatorics study integrates concerns from other disciplines, such as Series, Hamming code and Code. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Statistical database, Database, Control, Limit and Optimization problem.
His Upper and lower bounds research integrates issues from Oblivious transfer, Search problem, Binary entropy function, Linear search and Class. His biological study deals with issues like Maximum cost, which deal with fields such as Finite set and Graph theory. His Group testing study combines topics in areas such as Generalization and Contrast.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Network information flow
R. Ahlswede;Ning Cai;S.-Y.R. Li;R.W. Yeung.
IEEE Transactions on Information Theory (2000)
Common randomness in information theory and cryptography. I. Secret sharing
R. Ahlswede;I. Csiszar.
IEEE Transactions on Information Theory (1993)
Multi-way communication channels
international symposium on information theory (1973)
The Capacity Region of a Channel with Two Senders and Two Receivers
Annals of Probability (1974)
Elimination of correlation in random codes for arbitrarily varying channels
Probability Theory and Related Fields (1978)
The Complete Intersection Theorem for Systems of Finite Sets
Rudolf Ahlswede;Levon H. Khachatrian.
The Journal of Combinatorics (1997)
Source coding with side information and a converse for degraded broadcast channels
R. Ahlswede;J. Korner.
IEEE Transactions on Information Theory (1975)
Strong converse for identification via quantum channels
R. Ahlswede;A. Winter.
IEEE Transactions on Information Theory (2002)
Common randomness in information theory and cryptography. II. CR capacity
R. Ahlswede;I. Csiszar.
IEEE Transactions on Information Theory (1998)
Hypothesis testing with communication constraints
R. Ahlswede;I. Csiszar.
IEEE Transactions on Information Theory (1986)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: