Linear network coding

Linear network coding,10.1109/TIT.2002.807285,IEEE Transactions on Information Theory,Shuo-yen Robert Li,Raymond W. Yeung,Ning Cai

Linear network coding   (Citations: 1207)
BibTex | RIS | RefWorks Download
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.
Journal: IEEE Transactions on Information Theory - TIT , vol. 49, no. 2, pp. 371-381, 2003
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: