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, 1971, Volume 7, Issue 4, Pages 78–81 (Mi ppi1665)  
This article is cited in 1 scientific paper (total in 1 paper)

Large Systems

An Upper Bound for the Reliability of Information Networks

M. V. Lomonosov, V. P. Polesskii
Full-text PDF (280 kB) Citations (1)
Abstract: An upper bound is established for the reliability of an information network on the basis of the size of a certain family of cuts.
Received: 20.07.1970
Bibliographic databases:
Document Type: Article
UDC: 621.391.175:519.14
Language: Russian
Citation: M. V. Lomonosov, V. P. Polesskii, “An Upper Bound for the Reliability of Information Networks”, Probl. Peredachi Inf., 7:4 (1971), 78–81; Problems Inform. Transmission, 7:4 (1971), 337–339
Citation in format AMSBIB
\Bibitem{LomPol71}
\by M.~V.~Lomonosov, V.~P.~Polesskii
\paper An Upper Bound for the Reliability of Information Networks
\jour Probl. Peredachi Inf.
\yr 1971
\vol 7
\issue 4
\pages 78--81
\mathnet{http://mi.mathnet.ru/ppi1665}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=325279}
\zmath{https://zbmath.org/?q=an:0323.90024}
\transl
\jour Problems Inform. Transmission
\yr 1971
\vol 7
\issue 4
\pages 337--339
Linking options:
  • https://www.mathnet.ru/eng/ppi1665
  • https://www.mathnet.ru/eng/ppi/v7/i4/p78
    • 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:331
    Full-text PDF :169
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024