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


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

E. Bakin

St. Petersburg State University of Aerospace Instrumentation

编辑信件的主要联系方式.
Email: jenyb@vu.spb.ru
俄罗斯联邦, St. Petersburg

G. Evseev

St. Petersburg State University of Aerospace Instrumentation

Email: jenyb@vu.spb.ru
俄罗斯联邦, St. Petersburg

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Inc., 2016