Remark on “on the capacity of a multiple-access vector adder channel” by A.A. Frolov and V.V. Zyablov
Evgeny A. Bakin, Grigory Evseev · Problems of Information Transmission · 2016
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 γ ∈ (0, γ*] and of the twisted distribution for γ ∈ (γ*,∞), where γ is the ratio of the number of users to the number of subchannels and γ* = 1.3382.