To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding ker...To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.展开更多
基金Project(60872005) supported by National Natural Science Foundation of China
文摘To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.
