Achievability proof of some multiuser channel coding theorems using backward decoding

DOI10.1109/18.45272MaRDI QIDQ3470410zbMATH OpenOpenAlexFDO

Authors Chao-Ming Zeng, Federico Kuhlmann, Andres Buzo

Publication date 1989

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.45272

zbMATH Keywords

achievability proofsbackward decoding techniquecoding theorems for the multiple-access channeldegraded relay channelfeedback

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Recommendations

• Partial feedback for the discrete memoryless multiple access channel (Corresp.)
• scientific article; zbMATH DE number 910967
• The capacity of the white Gaussian multiple access channel with feedback
• Generalized Backward Decoding Strategies for the Relay Channel
• On source coding with side information via a multiple-access channel and related problems in multi-user information theory

Cited in

(2)

• Generalized Backward Decoding Strategies for the Relay Channel
• Offset Encoding for Multiple-Access Relay Channels

This page was built for publication: Achievability proof of some multiuser channel coding theorems using backward decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3470410)