New algorithm for variable-rate linear broadcast network coding

Yin Xia , Ti-yuan Zhang , Jia-qing Huang

Journal of Central South University ›› 2011, Vol. 18 ›› Issue (4) : 1193 -1199.

PDF
Journal of Central South University ›› 2011, Vol. 18 ›› Issue (4) : 1193 -1199. DOI: 10.1007/s11771-011-0822-3
Article

New algorithm for variable-rate linear broadcast network coding

Author information +
History +
PDF

Abstract

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 information flow, the algorithm of construction is explicitly given within polynomial time O(|E|·|Tωmax2), 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.

Keywords

network coding / variable-rate / linear broadcast / heterogeneous network / code construction algorithm

Cite this article

Download citation ▾
Yin Xia,Ti-yuan Zhang,Jia-qing Huang. New algorithm for variable-rate linear broadcast network coding. Journal of Central South University, 2011, 18(4): 1193-1199 DOI:10.1007/s11771-011-0822-3

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF

84

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/