Linear network coding
Linear network coding
复制标题
DOI：
10.1109/tit.2002.807285
复制
发表时间：
2003-02-01
影响因子：
2.5
通讯作者：
Cai, N
中科院分区：
文献类型：
--
作者：
Li, SYR;Yeung, RW;Cai, N
考虑一个通信网络。其中某些源节点以多跳方式向网络上的其他节点多播信息，其中每个节点都可以将其接收到的任何数据传递给其他节点。我们感兴趣的是每个节点可以多快地接收完整的信息，或者等价地，到达每个节点的信息速率是多少。允许一个节点在传递之前对其接收到的数据进行编码，这个问题涉及到节点处的多播机制的优化。其中最简单的编码方案是线性编码，它把一个块的数据作为一个向量在一定的基字段，并允许一个节点应用线性变换到一个向量之前，通过它on.We制定这个多播问题，并证明线性编码足以实现最佳的，这是从源到每个接收节点的最大流。
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.