Ben Leong

Computer Networks and Communications · 2004–2006

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

Subfields

• Computer Networks and Communications — 15 citations into it; #7,176 of 9,886 by trust here, #3,005 by citations
• Electrical and Electronic Engineering — 10 citations into it; #10,542 of 16,539 by trust here, #7,422 by citations

Whom Ben Leong trusts overall

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

1. Ralf Koetter
2. T. Ho

Who trusts Ben Leong overall

1. Supratim Deb

Papers from Ben Leong's perspective

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

1. Network information flow (IEEE Transactions on Information Theory)
2. The benefits of coding over routing in a randomized setting (IEEE International Symposium on Information Theory. Proceedings)
3. Polynomial time algorithms for network information flow (ACM Symposium on Parallelism in Algorithms and Architectures)
4. Practical Byzantine fault tolerance
5. Capacity of wireless erasure networks (IEEE Transactions on Information Theory)
6. Secure routing for mobile ad hoc networks (IEEE Communications Surveys and Tutorials)
7. On Randomized Network Coding
8. An algebraic approach to network coding (Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252))
9. Full length article: On coding for reliable communication over packet networks
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
• Byzantine modification detection in multicast networks using randomized network coding (2004) — 301 citations