On the capacity of a multiple-access vector adder channel

DOI10.1134/S0032946014020021zbMath1321.94024arXiv1401.2118OpenAlexW2088425358MaRDI QIDQ2262998

Victor Zyablov, Alexey Frolov

Publication date: 17 March 2015

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

Full work available at URL: https://arxiv.org/abs/1401.2118

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)

Related Items (1)

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

Cites Work

• On the asymptotic capacity of a multi-access channel
• Note on ``On the asymptotic capacity of a multiple-access channel by L. Wilhelmsson and K. Sh. Zigangirov
• Evaluation of the asymptotics of the summarized capacity of an \(M\)-frequency \(T\)-user noiseless multiple-access channel
• Multiple access system for a vector disjunctive channel
• Coding for T-user multiple-access channels
• On the T-user M-frequency noiseless multiple-access channel with and without intensity information
• On the capacity of the asynchronous T-user M-frequency noiseless multiple-access channel without intensity information

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