Referenced Items are not available for this document.
The multicast capacity is determined for networks that have deterministic channels with broadcasting at the transmitters and no interference at the receivers. The multicast capacity is shown to have a cut-set interpretation. It is further shown that one cannot always layer channel and network coding in such networks. The proof of the latter result partially generalizes to discrete memoryless broadcast channels and is used to bound the common rate for problems where one achieves a cut bound on throughput.
Published in:
Information Theory, IEEE Transactions on
(Volume:52
,
Issue:
6
)
Date of Publication: June 2006
- Page(s):
- 2425 - 2432
- ISSN :
- 0018-9448
- INSPEC Accession Number:
- 8943022
- Digital Object Identifier :
- 10.1109/TIT.2006.874431
- 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.
