Linear network coding

被引：2128

作者：

Li, SYR ^{[1
]}

Yeung, RW ^{[1
]}

Cai, N ^{[1
]}

机构：

[1] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2003年 / 49卷 / 02期

关键词：

coding; network routing; switching;

D O I：

10.1109/TIT.2002.807285

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：371 / 381

页数：11