Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Problemy Peredachi Informatsii, 1981, Volume 17, Issue 1, Pages 90–95 (Mi ppi1383)  

This article is cited in 1 scientific paper (total in 1 paper)

Large System Science and Communications-Network Theory

Upper Bound for the Capacity of a Random Multiple Access System

V. A. Mikhailov, B. S. Tsybakov
Full-text PDF (347 kB) Citations (1)
Abstract: It is shown that the normalized capacity of a system of synchronized random multiple access is less than 0.587 packets per unit time.
Received: 10.11.1980
Bibliographic databases:
Document Type: Article
UDC: 621.394.74
Language: Russian
Citation: V. A. Mikhailov, B. S. Tsybakov, “Upper Bound for the Capacity of a Random Multiple Access System”, Probl. Peredachi Inf., 17:1 (1981), 90–95; Problems Inform. Transmission, 17:1 (1981), 63–67
Citation in format AMSBIB
\Bibitem{MikTsy81}
\by V.~A.~Mikhailov, B.~S.~Tsybakov
\paper Upper Bound for the Capacity of a~Random Multiple Access System
\jour Probl. Peredachi Inf.
\yr 1981
\vol 17
\issue 1
\pages 90--95
\mathnet{http://mi.mathnet.ru/ppi1383}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=647427}
\zmath{https://zbmath.org/?q=an:0484.94004}
\transl
\jour Problems Inform. Transmission
\yr 1981
\vol 17
\issue 1
\pages 63--67
Linking options:
  • https://www.mathnet.ru/eng/ppi1383
  • https://www.mathnet.ru/eng/ppi/v17/i1/p90
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:335
    Full-text PDF :157
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024