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

DOI10.1109/18.532885MaRDI QIDQ4896823zbMATH OpenOpenAlexFDO

Authors 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

Kuhn-Tucker conditionsmultiple-access channel (MAC)mutual informationtotal capacity

Mathematics Subject Classification ID

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

Recommendations

• On the capacity of the two-user<tex>M</tex>-ary multiple-access channel with feedback (Corresp.)
• The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
• Capacity parametrization of a multiple-access binary adder channel with shared information
• The capacity of binary channels that use linear codes and decoders
• On Capacities of the Two-User Union Channel With Complete Feedback
• Capacity of the product and sum of two unmatched broadcast channels
• Upper and lower bounds on the binary input AWGN channel capacity
• Capacity of the Gaussian Two-Pair Two-Way Relay Channel to Within $\frac{1}{2}$ Bit
• Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels
• Precise capacity analysis in binary networks with multiple coding level inputs

Cited in

(1)

• Capacity of the product and sum of two unmatched broadcast channels

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)