Linear network coding

By Shuo-Yen Robert Li, Raymond W. Yeung, Ning Cai. IEEE Transactions on Information Theory, 2003

1,670 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/3a2ec05573582a278212960c1a85fb29177e54e4

How researchers see this paper

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

In Computational Theory and Mathematics

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Full length article: On coding for reliable communication over packet networks (2008, neutral): “We expect, at any rate, that this delay will not significantly alter our conclusions, just as it does not significantly alter the main conclusions of [10, 11], which deal with linear coding in lossless networks.”
Growth codes: maximizing sensor network data persistence (2006, background): “A particular area of recent interest is the application of network coding within multicast environments (e.g., [29, 9], where it has been shown that simple linear codes are very efficient [ 24 ].”
A Survey on Network Codes for Distributed Storage (2010, background): “collectors. For multicasting, it is known that the maximum multicast rate is equal to the minimum-cut capacity separating the source from a receiver and it can be achieved using linear network coding [16]. Since the current problem can be viewed as a multicast problem, the fundamental limit can be c”
XORs in the air: practical wireless network coding (2008, background): “Li et al. show that for multicast traffic linear codes are sufficient to achieve the maximum capacity bounds [ 5 ].”
Minimum-energy multicast in mobile ad hoc networks using network coding (2004, background): “Subsequently, Li, Yeung, and Cai [ 5 ] showed that it is sufcient for the encoding functions at the interior nodes to be linear.”
Computation Over Multiple-Access Channels (2007, background): “In [ 14 ] and [15], it was shown that linear encoding and decoding over a finite field is sufficient to achieve the multicast capacity.”