Algebraic gossip: a network coding approach to optimal multiple rumor mongering

By Supratim Deb, Muriel Médard, Clifford Choute. IEEE Transactions on Information Theory, 2006

320 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/30b405b86eb42e174f38ac4b0df4e735196c11c0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Devavrat Shah
2. J. Widmer
3. Christina Fragouli
4. J. L. Boudec
5. Jean-Pierre Hubaux
6. Zhili Sun
7. Zhensheng Zhang
8. Angelia Nedić

In Electrical and Electronic Engineering

1. Devavrat Shah
2. J. Widmer
3. Christina Fragouli
4. J. L. Boudec
5. Jean-Pierre Hubaux
6. Levente Buttyán

Citations in the corpus

• Network coding: an instant primer (2006, background): “This approach allows to disseminate all messages in Θ(n) rounds [7].”
• Gossip Algorithms (2009, methodology): “However, this computation can be avoided by means of random linear codes [14, 54].”
• Full length article: On coding for reliable communication over packet networks (2008, unknown): “of multicast over lossless wireline packet networks, in [ 17 ] for data dissemination, in [18] for”