Remark on ``on the capacity of a multiple-access vector adder channel

DOI10.1134/S0032946016010014MaRDI QIDQ522922zbMATH OpenFDO

Authors E. A. Bakin, G. S. Evseev

Publication date 19 April 2017

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

Full work available at URL https://doi.org/10.1134/S0032946016010014

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Recommendations

• On the capacity of a multiple-access vector adder channel
• Capacity parametrization of a multiple-access binary adder channel with shared information
• Nearly optimal multiuser codes for the binary adder channel
• Evaluation of the asymptotics of the summarized capacity of an \(M\)-frequency \(T\)-user noiseless multiple-access channel
• Limitations of the capacity of the M-user binary adder channel due to physical considerations

Cites work

• scientific article; zbMATH DE number 3805491 (Why is no real title available?)
• Note on ``On the asymptotic capacity of a multiple-access channel by L. Wilhelmsson and K. Sh. Zigangirov
• On the capacity of a multiple-access vector adder channel
• On the T-user M-frequency noiseless multiple-access channel with and without intensity information
• Table of integrals, series, and products. Translated from the Russian. Translation edited and with a preface by Alan Jeffrey and Daniel Zwillinger. With one CD-ROM (Windows, Macintosh and UNIX)

Cited in

(3)

• Capacity parametrization of a multiple-access binary adder channel with shared information
• On the capacity of a multiple-access vector adder channel
• Limitations of the capacity of the M-user binary adder channel due to physical considerations

This page was built for publication: Remark on ``on the capacity of a multiple-access vector adder channel

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