Linear network coding

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, w...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2003-02, Vol.49 (2), p.371-381
Main Authors: Li, S.-Y.R., Yeung, R.W., Ning Cai
Format: Article
Language:English
Subjects:
Channel capacity
Communication networks
Communication switching
Conferences
Cryptography
Information rates
Information theory
Network coding
Routing
Spread spectrum communication
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2002.807285