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

Achievability proof of some multiuser channel coding theorems using backward decoding

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)
Zeng, C.-M. ; Univ. Nacional Autonoma de Medico, Mexico City, Mexico ; Kuhlmann, F. ; Buzo, A.

New and simpler achievability proofs that are based on the backward decoding technique are presented for the well-known coding theorems for the multiple-access channel (MAC) with perfect feedback and the degraded relay channel. A class of MACs with different generalized feedback signals is also considered, and achievable-rate regions that are larger than those previously presented in the literature are established

Published in:

Information Theory, IEEE Transactions on  (Volume:35 ,  Issue: 6 )

Date of Publication:

Nov 1989

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.