By Topic

The encoding complexity of network coding with two simple multicast sessions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wentu Song ; LMAM, School of Mathematical Sciences, Peking University, Beijing 100871, China ; Kai Cai ; Rongquan Feng

We consider the encoding complexity of two simple multicast network coding problem (2-SMNC). The network is a directed acyclic graph, where two messages are required to send from two sources to two groups of sinks respectively. We proved that the number of encoding links required to achieve a network coding solution is upper-bounded by max{3, 2N - 2} and the field size required to achieve a linear solution is upper-bounded by max{2,⌊(√2N-7/4)+1/2⌋}, where N is the number of sinks. Both bounds are shown to be tight.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference:

29-31 May 2012