H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Computer Science H-index 42 Citations 21,023 188 World Ranking 4039 National Ranking 187
Mathematics H-index 43 Citations 7,947 195 World Ranking 832 National Ranking 45

Research.com Recognitions

Awards & Achievements

2006 - IEEE Claude E. Shannon Award

Overview

What is he best known for?

The fields of study he is best known for:

  • Combinatorics
  • Discrete mathematics
  • Statistics

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 most cited work include:

  • Network information flow (7321 citations)
  • Common randomness in information theory and cryptography. I. Secret sharing (1190 citations)
  • Multi-way communication channels (618 citations)

What are the main themes of his work throughout his whole career to date?

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.

He most often published in these fields:

  • Discrete mathematics (45.05%)
  • Combinatorics (43.24%)
  • Information theory (13.81%)

What were the highlights of his more recent work (between 2007-2019)?

  • Combinatorics (43.24%)
  • Discrete mathematics (45.05%)
  • Coding (7.51%)

In recent papers he was focusing on the following fields of study:

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.

Between 2007 and 2019, his most popular works were:

  • Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels (47 citations)
  • General theory of information transfer: Updated (36 citations)
  • Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels (35 citations)

In his most recent research, the most cited papers focused on:

  • Combinatorics
  • Algebra
  • Statistics

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.

Top Publications

Network information flow

R. Ahlswede;Ning Cai;S.-Y.R. Li;R.W. Yeung.
IEEE Transactions on Information Theory (2000)

10320 Citations

Common randomness in information theory and cryptography. I. Secret sharing

R. Ahlswede;I. Csiszar.
IEEE Transactions on Information Theory (1993)

1921 Citations

Multi-way communication channels

Rudolf Ahlswede.
international symposium on information theory (1973)

967 Citations

The Capacity Region of a Channel with Two Senders and Two Receivers

Rudolf Ahlswede.
Annals of Probability (1974)

506 Citations

Elimination of correlation in random codes for arbitrarily varying channels

Rudolf Ahlswede.
Probability Theory and Related Fields (1978)

480 Citations

The Complete Intersection Theorem for Systems of Finite Sets

Rudolf Ahlswede;Levon H. Khachatrian.
The Journal of Combinatorics (1997)

476 Citations

Source coding with side information and a converse for degraded broadcast channels

R. Ahlswede;J. Korner.
IEEE Transactions on Information Theory (1975)

473 Citations

Strong converse for identification via quantum channels

R. Ahlswede;A. Winter.
IEEE Transactions on Information Theory (2002)

439 Citations

Common randomness in information theory and cryptography. II. CR capacity

R. Ahlswede;I. Csiszar.
IEEE Transactions on Information Theory (1998)

324 Citations

Search Problems

Rudolf Ahlswede;Ingo Wegener.
(1987)

311 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

Top Scientists Citing Rudolf Ahlswede

Muriel Medard

Muriel Medard

MIT

Publications: 200

Holger Boche

Holger Boche

Technical University of Munich

Publications: 164

Frank H. P. Fitzek

Frank H. P. Fitzek

TU Dresden

Publications: 102

Michelle Effros

Michelle Effros

California Institute of Technology

Publications: 89

H. Vincent Poor

H. Vincent Poor

Princeton University

Publications: 80

Baochun Li

Baochun Li

University of Toronto

Publications: 68

Christina Fragouli

Christina Fragouli

University of California, Los Angeles

Publications: 66

Michael Gastpar

Michael Gastpar

École Polytechnique Fédérale de Lausanne

Publications: 65

Raymond W. Yeung

Raymond W. Yeung

Chinese University of Hong Kong

Publications: 60

Joao Barros

Joao Barros

University of Bern

Publications: 60

Tuvi Etzion

Tuvi Etzion

Technion – Israel Institute of Technology

Publications: 60

Tracey Ho

Tracey Ho

California Institute of Technology

Publications: 59

Michael Langberg

Michael Langberg

University at Buffalo, State University of New York

Publications: 58

Masahito Hayashi

Masahito Hayashi

Southern University of Science and Technology

Publications: 58

Zongpeng Li

Zongpeng Li

Wuhan University

Publications: 55

Something went wrong. Please try again later.