Capacity parametrization of a multiple-access binary adder channel with shared information

zbMATH Open0666.94006MaRDI QIDQ1117197

A. Ya. Belokopytov

Publication date: 1988

Published in: Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

binary adder channel with shared informationmultiple-access channels

Mathematics Subject Classification ID

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

Related Items (3)

The total capacity of two-user multiple-access channel with binary output ⋮ From Winner-Takes-All to Winners-Share-All: Exploiting the Information Capacity in Temporal Codes ⋮ On the capacity of a multiple-access vector adder channel

This page was built for publication: Capacity parametrization of a multiple-access binary adder channel with shared information

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