版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:China Univ Petr Coll Sci Qingdao 266580 Shandong Peoples R China
出 版 物:《IEEE ACCESS》 (IEEE Access)
年 卷 期:2022年第10卷
页 面:102421-102431页
核心收录:
基 金:Shandong Provincial Natural Science Foundation of China [ZR2019MF070] National Natural Science Foundation of China Fundamental Research Funds for the Central Universities [20CX05012A, 22CX03015A] Major Scienti~c and Technological Projects of CNPC [ZD2019-183-008]
主 题:Network coding cyclic network delay invariant convolutional network codes construction algorithm
摘 要:Delay invariant convolutional network codes (abbreviated DI-CNCs) can guarantee multicast communication at asymptotically optimal rates in networks with any delay profile. For a cyclic network, it has been shown that one can associate it with an acyclic network consisting of nodes in five layers, and the acyclic algorithm of F-linear multicast can be employed to construct a DI-F-CNC, as long as the field size is larger than the number of sinks in the cyclic network. In this paper, we present a directly feasible construction algorithm for a DI-F-CNC over a cyclic network. Complexity of code construction and theoretical guarantees of algorithm implementation are also investigated in detail. The advantage of the straight construction algorithm is that for an existing code, when some sink nodes and associated edges are added, our algorithm just modifies the new assigned coding coefficients in an efficient localized manner, without the necessity to construct again the code in its expanding network.