Remark on “on the capacity of a multiple-access vector adder channel” by A.A. Frolov and V.V. Zyablov
- Authors: Bakin E.A.1, Evseev G.S.1
-
Affiliations:
- St. Petersburg State University of Aerospace Instrumentation
- Issue: Vol 52, No 1 (2016)
- Pages: 1-5
- Section: Information Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166251
- DOI: https://doi.org/10.1134/S0032946016010014
- ID: 166251
Cite item
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 γ ∈ (0, γ*] and of the twisted distribution for γ ∈ (γ*,∞), where γ is the ratio of the number of users to the number of subchannels and γ* = 1.3382.
About the authors
E. A. Bakin
St. Petersburg State University of Aerospace Instrumentation
Author for correspondence.
Email: jenyb@vu.spb.ru
Russian Federation, St. Petersburg
G. S. Evseev
St. Petersburg State University of Aerospace Instrumentation
Email: jenyb@vu.spb.ru
Russian Federation, St. Petersburg
Supplementary files
