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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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

Supplementary Files
Action
1. JATS XML

Copyright (c) 2016 Pleiades Publishing, Inc.