By Topic

Multi-source noisy 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

4 Author(s)
Sung Lim ; Dept. of EE, KAIST, Daejeon, South Korea ; Young-Han Kim ; El Gamal, A. ; Sae-Young Chung

Noisy network coding unifies network coding by Ahlswede, Cai, Li, and Yeung for noiseless networks and compress-forward by Cover and El Gamal for noisy relay channels. In particular, it achieves the best known capacity inner bounds for multi-source multicast networks including deterministic networks by Avestimehr, Diggavi, and Tse and erasure networks by Dana, Gowaikar, Palanki, Hassibi, and Effros. This paper extends noisy network coding for multicast networks to networks with general message demand by combining the underlying noisy network coding scheme with decoding techniques for interference channels. At one extreme, noisy network coding is combined with simultaneous decoding, while at the other extreme interference is treated as noise. The potential of noisy network coding as a canonical building block for wireless networks is demonstrated via three examples of Gaussian networks that have drawn recent attentions.

Published in:

Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on

Date of Conference:

13-18 June 2010