Achievability proof of some multiuser channel coding theorems using backward decoding
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (6) , 1160-1165
- https://doi.org/10.1109/18.45272
Abstract
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 establishedKeywords
This publication has 10 references indexed in Scilit:
- The discrete memoryless multiple-access channel with cribbing encodersIEEE Transactions on Information Theory, 1985
- Partial feedback for the discrete memoryless multiple access channel (Corresp.)IEEE Transactions on Information Theory, 1983
- Multiple-access channels with different generalized feedback signalsIEEE Transactions on Information Theory, 1982
- The feedback capacity region of a class of discrete memoryless multiple access channels (Corresp.)IEEE Transactions on Information Theory, 1982
- An achievable rate region for the multiple-access channel with feedbackIEEE Transactions on Information Theory, 1981
- A new achievable rate region for the interference channelIEEE Transactions on Information Theory, 1981
- Multiple user information theoryProceedings of the IEEE, 1980
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- Source coding with side information and a converse for degraded broadcast channelsIEEE Transactions on Information Theory, 1975
- An achievable rate region for the broadcast channelIEEE Transactions on Information Theory, 1975