Linear network coding

Abstract

Consider a communication network in which certain source nodes multicast information to other nodes on the network in the multihop fashion where every node can pass on any of its received data to others. We are interested in how fast each node can receive the complete information, or equivalently, what the information rate arriving at each node is. Allowing a node to encode its received data before passing it on, the question involves optimization of the multicast mechanisms at the nodes. Among the simplest coding schemes is linear coding, which regards a block of data as a vector over a certain base field and allows a node to apply a linear transformation to a vector before passing it on. We formulate this multicast problem and prove that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.

DOI: 10.1109/TIT.2002.807285

Extracted Key Phrases

3 Figures and Tables

0100200300'02'04'06'08'10'12'14'16
Citations per Year

3,001 Citations

Semantic Scholar estimates that this publication has 3,001 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Li2003LinearNC, title={Linear network coding}, author={Shuo-Yen Robert Li and Raymond W. Yeung and Ning Cai}, journal={IEEE Trans. Information Theory}, year={2003}, volume={49}, pages={371-381} }