By Topic

Explicit Inner and Outer Bounds for Multi-source Multi-sink 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
$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)
Xijin Yan ; Dept. of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA 90089-2565, U.S.A. Email: ; Zhen Zhang ; Jun Yang

In multi-source multi-sink network coding, messages across different sources are coded to increase the overall throughput. The various types of coded information in the network significantly complicate the determination of its capacity region. In this work, we derive explicit inner and outer bounds for acyclic multi-source multi-sink networks based on a cut-based network decomposition technique and a role-based information characterization technique. In particular, we derive a linear programming inner bound for regular K-pairs acyclic three-layer networks and a network sharing outer bound for arbitrary acyclic multi-source multi-sink networks. The techniques used in this paper reveal some of the basic mechanisms of multi-source multi-sink network coding

Published in:

2006 IEEE International Symposium on Information Theory

Date of Conference:

9-14 July 2006