A Random Linear Network Coding Approach to Multicast

By T. Ho, Muriel Médard, Ralf Koetter, David R Karger, Michelle Effros, Jun Shi, Ben Leong. IEEE Transactions on Information Theory, 2006

2,685 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/cfc4a38958fcc6116a9a7a7b57b737df4884251d

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

Locally Repairable Codes (2012, methodology): “We establish the theorem through capacity achieving schemes for a specific communication network; such network will be defined through a directed and acyclic flow-graph.”
Wireless Device-to-Device Caching Networks: Basic Principles and System Performance (2013, background): “In Section IV, we will see that the schemes designed by this simple model yields promising performance also in realistic propagation and interference conditions.”
Coding for Errors and Erasures in Random Network Coding (2007, methodology): “There, the properties of codes in the Grassmann graphs are used to detect tampering with an authenticated message.”
A Survey on Network Codes for Distributed Storage (2010, background): “Further work showed that linear network coding suffices [16], [18] and random linear combinations construct good network codes with high probability [19].”
Wireless Network Information Flow: A Deterministic Approach (2009, methodology): “The analysis for deterministic networks not only gives us insights for potentially successful coding schemes for the Gaussian case, but also gives tools for the proof techniques used.”
EXISTENCE OF $q$ -ANALOGS OF STEINER SYSTEMS (2013, background): “In random network coding [24, 54], a source of information injects into the network several (say, k) vectors lying in some ambient space Fn q .”
Compute-and-Forward: Harnessing Interference Through Structured Codes (2009, background): “It resembles random linear network coding [27] except here the randomness stems entirely from the channel coefficients.”
Decentralized erasure codes for distributed networked storage (2006, methodology): “It has been shown that random linear network codes [18], [16] are sufﬁcient for multicasting problems as long as the underlying network can support the required throughput.”
Full length article: On coding for reliable communication over packet networks (2008, neutral): “ts at the source. If the source has more packets to send, then the scheme is repeated with all nodes ﬂushed of their memory contents. Similar random linear coding schemes are described in [13], [14], [15], [16] for the application of multicast over lossless wireline packet networks, in [17] for data”
Communicating the Sum of Sources Over a Network (2010, methodology): “We conclude, using Lemma 4 of [4], that α obtains that value0 with probability at most1−(1−2) (over the choice of the values of variables in C).”
A Rank-Metric Approach to Error Control in Random Network Coding (2007, methodology): “We start by reviewing the basic model for single-source generation-based random linear network coding [2], [3].”