This article is cited in 3 papers

Information Theory

Remark on “On the capacity of a multiple-access vector adder channel” by A. A. Frolov and V. V. Zyablov

E. A. Bakin, G. S. Evseev

St. Petersburg State University of Aerospace Instrumentation, St. Petersburg, Russia

Abstract: For vector adder channel, we present an upper bound on the capacity, which coincides with the lower bound given in [1]. Thus, we prove optimality of the uniform probability distribution of symbols for $\gamma\in(0,\gamma^*]$ and of the twisted distribution for $\gamma\in(\gamma^*,\infty)$, where $\gamma$ is the ratio of the number of users to the number of subchannels and $\gamma^*=1.3382$.

UDC: 621.391.1

Received: 30.04.2015
Revised: 09.09.2015

 English version: Problems of Information Transmission, 2016, 52:1, 1–5

Bibliographic databases:

• 
• 
• 
• 
•