Ralf Koetter

Computer Networks and Communications · 2000–2008

A researcher in the Science corpus: 13 papers; trusts 30 researchers and is trusted by 59 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 57 citations into it; #369 of 9,886 by trust here, #490 by citations
• Electrical and Electronic Engineering — 44 citations into it; #364 of 16,539 by trust here, #2,981 by citations
• Computer Vision and Pattern Recognition — 16 citations into it; #11,403 of 21,575 by trust here, #20,271 by citations
• Artificial Intelligence — 15 citations into it; #26,896 of 35,345 by trust here, #25,809 by citations
• Computational Theory and Mathematics — 10 citations into it; #1,050 of 12,182 by trust here, #1,500 by citations

Whom Ralf Koetter trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Dimitri P. Bertsekas
2. T. Ho
3. Lawrence R. Rabiner
4. Frank R. Kschischang
5. Claude E. Shannon
6. Michael Tüchler
7. Muriel Médard
8. Stephan ten Brink
9. Ram Zamir
10. Uri Erez

Who trusts Ralf Koetter overall

1. T. Ho
2. Sachin Rajsekhar Katti
3. John Sheekey
4. Muriel Médard
5. Sidharth Jaggi
6. M. Schmidt
7. A. Dimakis
8. J. Nicholas Laneman
9. Danilo Silva
10. Dina Katabi

Papers from Ralf Koetter's perspective

Ordered by how strongly the researchers Ralf Koetter trusts endorse each paper. Same corpus, a different order for every researcher.

1. Network information flow (IEEE Transactions on Information Theory)
2. Factor graphs and the sum-product algorithm
3. A tutorial on hidden Markov models and selected applications in speech recognition
4. Low-Density Parity-Check Codes
5. The capacity of low-density parity-check codes under message-passing decoding (IEEE Transactions on Information Theory)
6. The benefits of coding over routing in a randomized setting (IEEE International Symposium on Information Theory. Proceedings)
7. Coding for Errors and Erasures in Random Network Coding (IEEE Transactions on Information Theory)
8. Polynomial time algorithms for network information flow (ACM Symposium on Parallelism in Algorithms and Architectures)
9. Capacity of wireless erasure networks (IEEE Transactions on Information Theory)
10. LT codes (The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.)

Their papers

• A Random Linear Network Coding Approach to Multicast (2006) — 2,685 citations
• An algebraic approach to network coding (2001) — 2,542 citations
• The benefits of coding over routing in a randomized setting (2003) — 1,187 citations
• Turbo equalization: principles and new results (2002) — 1,279 citations
• Coding for Errors and Erasures in Random Network Coding (2007) — 1,168 citations
• Full length article: On coding for reliable communication over packet networks (2008) — 646 citations
• Minimum mean squared error equalization using a priori information (2002) — 1,015 citations
• Byzantine modification detection in multicast networks using randomized network coding (2004) — 301 citations
• Data-Hiding Codes (2005) — 358 citations
• A Rank-Metric Approach to Error Control in Random Network Coding (2007) — 580 citations
• Minimum-cost multicast over coded packet networks (2005) — 447 citations
• Turbo equalization (2004) — 429 citations
• Algebraic soft-decision decoding of Reed-Solomon codes (2000) — 675 citations