Cart (Loading....) | Create Account
Close category search window
 

An Implicit Characterization of the Achievable Rate Region for Acyclic Multisource Multisink 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

3 Author(s)
Yan, X. ; Communication Sciences Institute, Department of Electrical Engineering-Systems, University of Southern California, Los Angeles, CA, USA ; Yeung, R.W. ; Zhen Zhang

The achievable information rate region problem of multisource multisink network coding for general acyclic networks with arbitrary transmission requirements has previously been studied, where inner and outer bounds on the region were derived in terms of $Gamma^{ast}$ , the fundamental region of entropy functions. In this paper, we derive the exact characterization of the achievable rate region in terms of entropic functions, thus closing the gap between the existing inner and outer bounds.

Published in:

Information Theory, IEEE Transactions on  (Volume:58 ,  Issue: 9 )

Date of Publication:

Sept. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.