Remark on “on the capacity of a multiple-access vector adder channel” by A.A. Frolov and V.V. Zyablov
- 作者: Bakin E.A.1, Evseev G.S.1
-
隶属关系:
- St. Petersburg State University of Aerospace Instrumentation
- 期: 卷 52, 编号 1 (2016)
- 页面: 1-5
- 栏目: Information Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166251
- DOI: https://doi.org/10.1134/S0032946016010014
- ID: 166251
如何引用文章
详细
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
补充文件
