|
Problemy Peredachi Informatsii, 1987, Volume 23, Issue 3, Pages 64–78
(Mi ppi817)
|
|
|
|
This article is cited in 1 scientific paper (total 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].
Received: 04.07.1985
Citation:
B. S. Tsybakov, N. B. Likhanov, “Upper Bound on the Capacity of a Random Multiple-Access System”, Probl. Peredachi Inf., 23:3 (1987), 64–78; Problems Inform. Transmission, 23:3 (1987), 224–236
Linking options:
https://www.mathnet.ru/eng/ppi817 https://www.mathnet.ru/eng/ppi/v23/i3/p64
|
Statistics & downloads: |
Abstract page: | 506 | Full-text PDF : | 204 | First page: | 4 |
|