Close category search window
 

Noisy network coding approach to the relay channel with a random state

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

2 Author(s)
Khormuji, M.N. ; Sch. of Electr. Eng., R. Inst. of Technol. (KTH), Stockholm, Sweden ; Skoglund, M.

We consider the three-node relay channel with a random state. We assume that noncausal knowledge of the random state is partially known at the nodes. We present an achievable rate based on the noisy network coding (NNC) and the Gelfand-Pinsker random binning strategies. We then compare the achievable rate of NNC with that of compress-and-forward.

Published in:
Information Sciences and Systems (CISS), 2011 45th Annual Conference on

Date of Conference: 23-25 March 2011

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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.