An efficient basic convolutional network code construction algorithm on cyclic networks

Author:  Xubo Zhao

Abstract: 
Similar to acyclic networks, over cyclic networks, there also exist four classes of optimal convolutional network codes, which are referred to as basic convolutional network code (BCNC), convolutional dispersion (CD), convolutional broadcast (CB), and convolutional multicast (CM), respectively. And from the perspective of linear independence among the global encoding kernels (GEKs), BCNC is with the best strength. In this paper, we present an efficient construction algorithm for BCNC over cyclic networks. Our algorithm can positively provide the maximal required cardinality of the local encoding kernels (LEKs). Another advantage ofthis algorithm is thatfor an existing code, when some non-source nodes and associated edges are added, our algorithm can correspondingly modify the already assigned LEKs in a localized manner. And we can just reset the LEKs along some special flow paths educed by the added nodes and edges, rather than reconstructing the whole code in its expanding network.

Keywords:
Cyclic network
Basic convolutional network coding
Partial encoding kernel
Construction algorithm

Published in: AEÜ-International Journal of Electronics and Communications (Volume 67, Issue 12, December  2013)

Publisher: Elsevier

ISSN Information: 1434-8411

An efficient basic convolutional network code construction algorithm on cyclic networks

Bình luận của bạn

*

*

*

*

 Captcha

Gửi bình luận nhập lại