一种高效的卷积多播网络码算法

In this paper, we present an algorithm to construct the convolutional multicast network coding over any finite directed cyclic graph from a brand-new point. In this algorithm, we consider the dual line graph of a directed cyclic graph as a system, in which the global encoding kernels in the original graph are the corresponding inputs or outputs and the local encoding kernels in original graph are gains of channels. Then we can construct the convolutional multicast by using the classical Mason formula on the system.