New algorithm for variable-rate linear broadcast network coding

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,...

Full description

Saved in:
Bibliographic Details
Published inJournal of Central South University of Technology. Science & technology of mining and metallurgy Vol. 18; no. 4; pp. 1193 - 1199
Main Authors Xia, Yin, Zhang, Ti-yuan, Huang, Jia-qing
Format Journal Article
LanguageEnglish
Published Heidelberg Central South University 01.08.2011
Subjects
Online AccessGet full text
ISSN1005-9784
1993-0666
DOI10.1007/s11771-011-0822-3

Cover

More Information
Summary: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 |· ω max 2 ), 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.
ISSN:1005-9784
1993-0666
DOI:10.1007/s11771-011-0822-3