The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)

DOI10.1109/TIT.1983.1056660zbMATH Open0504.94024MaRDI QIDQ4740482FDOQ4740482

Frans M. J. Willems

Publication date: 1983

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

zbMATH Keywords

communication situationfinite capacities

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cited In (6)

• Cooperative multiple access channels: achievable rates and optimal resource allocation
• Classical capacities of quantum channels with environment assistance
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• The classical-quantum multiple access channel with conferencing encoders and with common messages
• Strong Secrecy for Multiple Access Channels
• On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders

This page was built for publication: The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.)

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