Home > Papers

 
 
An Efficient Algorithm of Convolutional Multicast Coding
Guo Qin 1 * #,Luo Mingxing 1,Ma Songya 1,Wang Licheng 1,Yang Yixian 2
1.Information Security Center, State Key Laboratory of Networking and Switching Technology，Beijing University of Posts and Telecommunications；National Engineering Laboratory for Disaster Backup and Recovery
2.Information Security Center,
*Correspondence author
#Submitted by
Subject:
Funding: National Natural Science Foundation of China and the Research Grants Council of Hong Kong Joint Research,National Basic Research Program of China&（No.60731160626,2007CB310704,60821001, 60805043, 60673098）
Opened online:10 February 2009
Accepted by: none
Citation: Guo Qin ,Luo Mingxing ,Ma Songya .An Efficient Algorithm of Convolutional Multicast Coding[OL]. [10 February 2009] http://en.paper.edu.cn/en_releasepaper/content/28663
 
 
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.
Keywords:Convolutional network code;convolutional multicast;dual line graph;Mason formula
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers
  • Other similar papers

Statistics
PDF Downloaded 245
Bookmarked 0
Recommend 5
Comments Array
Submit your papers