By Topic

An improved bound for multiple source-sink linear network coding

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
$31 $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

2 Author(s)
Eamopas, M. ; Dept. of Comput. Eng., Kasetsart Univ., Bangkok, Thailand ; Fakcharoenphol, J.

This paper considers the linear network coding problem when there are k independent source-sink pairs. The problem when k is not bounded, this problem is NP-hard. Recently Iwama, Nishimura, Peterson, Raymond, and Yamashita show that when k is fixed and the field F is fixed, the problem can be solved in polynomial time. One of their key lemmas shows that the number of vertices in the network performing the K encoding operations is at most |F|3k This paper improves the k bound exponentially to k2 |F|2k Since their algorithm's running time depends on this bound exponentially, our bound implies an improved running time.

Published in:

Computer Science and Software Engineering (JCSSE), 2011 Eighth International Joint Conference on

Date of Conference:

11-13 May 2011