RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1987 Volume 23, Issue 3, Pages 64–78 (Mi ppi817)
This article is cited in 1 paper

Communication Network Theory

Upper Bound on the Capacity of a Random Multiple-Access System

B. S. Tsybakov, N. B. Likhanov


Abstract: An upper bound $C\leq 0,568$ is obtained for the capacity$C$ of a random multiple-access system. This is an improvement on the best of the known bounds proved by Tszan and Berger [Probl. Peredachi Inf., 1985, vol. 21, no. 4, pp. 83–87].

UDC: 621.391.1:621.394.74

Received: 04.07.1985


 English version: Problems of Information Transmission, 1987, 23:3, 224–236

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025