On Randomized Network Coding

By T. Ho, Muriel Médard, Jun Shi, Michelle Effros, David R Karger. 2003

607 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/464fcff2977f9cf51162158e60422b2f93e87af7

How researchers see this paper

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

1. A. Dimakis
2. T. Ho
3. Mea Wang
4. Ralf Koetter
5. Dong Nguyen
6. Supratim Deb
7. Kannan Ramchandran
8. J. Widmer

Citations in the corpus

• Growth codes: maximizing sensor network data persistence (2006, background): “Random Linear codes [35]: Here, the N original symbols are assumed to be elements of some finite field and each codeword is a linear combination of all N symbols, with the coefficients also being members of the same finite field.”
• Network coding for efficient communication in extreme networks (2005, background): “Algorithms where the coefficients of the encoding functions are chosen randomly [9, 2] have properties that make them very suitable for wireless ad-hoc networks [8, 23].”
• Full length article: On coding for reliable communication over packet networks (2008, unknown): “[6, 7], which are random linear coding schemes for lossless networks, and on the other by LT coding [1] and its extensions, which are random linear coding schemes for lossy channels.”
• How Practical is Network Coding? (2006, methodology): “, [7]), however, theoretically maintained that the blocks should be linearly independent with high probability.”
• XORs in the air: practical wireless network coding (2008, background): “Koetter and Medard [6] present polynomial time algorithms for encoding and decoding, and Ho et al. extend these results to random codes [ 7 ].”
• A Random Linear Network Coding Approach to Multicast (2006, background): “Portions of this work have appeared in [9], which introduced distributed random linear network coding; [8], which presented the Edmonds matrix formulation and a new bound on required field size for centralized network coding; [12], which generalized previous results to arbitrary networks and gave ti”
• Wireless Broadcast Using Network Coding (2009, methodology): “Rather than using XOR operations, their scheme encodes every packet using coefficients that are randomly taken from a sufficiently large finite field [26], [27].”
• Decentralized erasure codes for distributed networked storage (2006, background): “In [1] the authors propose the use of random linear coding inspired by network coding for distributed networked storage with one centralized server and multiple storage locations.”
• Resilient Network Coding in the Presence of Byzantine Adversaries (2008, unknown): “But as shown in [11], as long as , this is at most for any fixed network.”
• Algebraic gossip: a network coding approach to optimal multiple rumor mongering (2006, result): “in [7, 8], and compare the protocol with a naive one.”
• Byzantine modification detection in multicast networks using randomized network coding (2004, background): “This approach achieves efficient shared use of multiple paths, giving greater robustness to link failures and random coding errors as excess capacity in the network increases [2].”
• XORs in the Air: Practical Wireless Network Coding (2006, unknown): “extend these results to random codes [7].”