Referenced Items are not available for this document.
Li and Li conjectured that in an undirected network with multiple unicast sessions, network coding does not lead to any coding gain. Surprisingly enough, this conjecture could not so far be verified even for the simple network consisting of K3,2 with four source-sink pairs. Using entropy calculus, we provide the first verification of the Li-Li conjecture for this network. We extend our bound to the case of an arbitrary directed bipartite network.
Published in:
Information Theory, IEEE Transactions on
(Volume:52
,
Issue:
6
)
Date of Publication: June 2006
- Page(s):
- 2805 - 2809
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 8943048
- Digital Object Identifier :
- 10.1109/TIT.2006.874543
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 05 June 2006
- Issue Date :
- June 2006
- Sponsored by :
- IEEE Information Theory Society
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
