The benefits of coding over routing in a randomized setting

By T. Ho, Ralf Koetter, Muriel Médard, David R Karger, Michelle Effros. IEEE International Symposium on Information Theory. Proceedings, 2003

1,187 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/9915c2b91673c3b024dbb043af8a8650dc31d7a2

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

In Electrical and Electronic Engineering

Citations in the corpus

How Practical is Network Coding? (2006, methodology): “We briefly summarize the concept of randomized network coding [3], [4], [5], [7].”
Algebraic gossip: a network coding approach to optimal multiple rumor mongering (2006, background): “In [7], [8], the authors proposed the novel idea of random network coding.”
XORs in the Air: Practical Wireless Network Coding (2006, background): “Prior wo k on network coding is mainly theoretical and focuses on multi cast traffic [2, 26, 20, 24, 17, 18, 27, 11].”
A Rank-Metric Approach to Error Control in Random Network Coding (2007, background): “W HILE random linear network coding [1]–[3] is an effective technique for information dissemination in communication networks, it is highly susceptible to errors.”
Network coding for large scale content distribution (2005, background): “(For a related discussion of the size of the field and the probability of decoding in a randomized setting see [27].”
Wireless Broadcast Using Network Coding (2009, background): “The main idea for the proposed schemes is based on the observation that, at a certain point in time, many receivers may have disjoint lost packets.”
PINT: Probabilistic In-band Network Telemetry (2020, background): “For example, Linear Network Coding (LNC) [32] allows one to decode a message in a near-optimal number of packets by taking random linear combinations over the message blocks.”
On Randomized Network Coding (2003, methodology): “This approach was flrst described in [ 3 ], which gave, for acyclic delay-free networks, a bound on error probability, in terms of the number of receivers and random coding output links, that decreases exponentially with code length.”
Symbol-level network coding for wireless mesh networks (2008, background): “Since R1 and R2 use random coefficients to produce the coded symbols, it is unlikely that they generate duplicate symbols [5].”
Full length article: On coding for reliable communication over packet networks (2008, positive): “Random linear network coding schemes similar to the one described above are examined in [4–7] for the application of multicast over lossless wireline packet networks, in [17] for data dissemination, in [18] for data storage, and in [19] for content distribution over peer-to-peer overlay networks.”
Network coding: an instant primer (2006, methodology): “ity of selecting linearly dependent combinations [14].”
The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments (2005, background): “Koetter and Médard [16] presented polynomial time algorithms for encoding and decoding, and Ho et al extended these results to random codes [13].”
Resilient Network Coding in the Presence of Byzantine Adversaries (2008, positive): “Additionally, Ho et al. show that the above is true even when the routers perform random linear operations [10].”
Polynomial time algorithms for multicast network code construction (2005, methodology): “Ho et al. [12] present a polynomial expected time construction to the same problem, using a randomized approach.”
Cooperative Security for Network Coding File Distribution (2006, background): “[17]), suffer from a number of inefficiencies which decrease their overall performance [19], [22], [24].”