The total capacity of two-user multiple-access channel with binary output

DOI10.1109/18.532885zbMATH Open0866.94012OpenAlexW2125417821MaRDI QIDQ4896823

Yoichiro Watanabe

Publication date: 30 July 1997

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

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

zbMATH Keywords

mutual informationKuhn-Tucker conditionstotal capacitymultiple-access channel (MAC)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Related Items (1)

Capacity of the product and sum of two unmatched broadcast channels

Recommendations

• Title not available (Why is that?) 👍 👎
• Capacity parametrization of a multiple-access binary adder channel with shared information 👍 👎
• Capacity of the product and sum of two unmatched broadcast channels 👍 👎
• Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels 👍 👎
• Precise Capacity Analysis in Binary Networks with Multiple Coding Level Inputs 👍 👎
• On the capacity of the two-user<tex>M</tex>-ary multiple-access channel with feedback (Corresp.) 👍 👎
• The capacity of binary channels that use linear codes and decoders 👍 👎
• Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within $\frac{1}{2}$ Bit 👍 👎
• On Capacities of the Two-User Union Channel With Complete Feedback 👍 👎
• The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet 👍 👎

This page was built for publication: The total capacity of two-user multiple-access channel with binary output

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