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


Probl. Peredachi Inf., 2000, Volume 36, Issue 2, Pages 3–9 (Mi ppi473)  

This article is cited in 8 scientific papers (total in 8 papers)

Information Theory

Evaluation of the Asymptotics of the Summarized Capacity of an $M$-Frequency $T$-User Noiseless Multiple-Access Channel

L. A. Bassalygo, M. S. Pinsker


Abstract: The best known estimates for the asymptotics of the summarized capacity of an $A$-channel are given. It is shown that the uniform input distribution is asymptotically optimal for a unique value of the parameter $\lambda$ ($T=\lambda M$, $0<\lambda<\infty$) namely, $\lambda=\ln 2$, and is not such in all other cases.

Full text: PDF file (701 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2000, 36:2, 91–97

Bibliographic databases:
UDC: 621.391.1:519.2
Received: 30.03.1999

Citation: L. A. Bassalygo, M. S. Pinsker, “Evaluation of the Asymptotics of the Summarized Capacity of an $M$-Frequency $T$-User Noiseless Multiple-Access Channel”, Probl. Peredachi Inf., 36:2 (2000), 3–9; Problems Inform. Transmission, 36:2 (2000), 91–97

Citation in format AMSBIB
\Bibitem{BasPin00}
\by L.~A.~Bassalygo, M.~S.~Pinsker
\paper Evaluation of the Asymptotics of the Summarized Capacity of an $M$-Frequency $T$-User Noiseless Multiple-Access Channel
\jour Probl. Peredachi Inf.
\yr 2000
\vol 36
\issue 2
\pages 3--9
\mathnet{http://mi.mathnet.ru/ppi473}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1763578}
\zmath{https://zbmath.org/?q=an:0972.94019}
\transl
\jour Problems Inform. Transmission
\yr 2000
\vol 36
\issue 2
\pages 91--97


Linking options:
  • http://mi.mathnet.ru/eng/ppi473
  • http://mi.mathnet.ru/eng/ppi/v36/i2/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. A. M. Barg, L. A. Bassalygo, V. M. Blinovskii, M. V. Burnashev, N. D. Vvedenskaya, G. K. Golubev, I. I. Dumer, K. Sh. Zigangirov, V. V. Zyablov, V. A. Zinov'ev, G. A. Kabatiansky, V. D. Kolesnik, N. A. Kuznetsov, V. A. Malyshev, R. A. Minlos, D. Yu. Nogin, I. A. Ovseevich, V. V. Prelov, Yu. L. Sagalovich, V. M. Tikhomirov, R. Z. Khas'minskii, B. S. Tsybakov, “Mark Semenovich Pinsker. In Memoriam”, Problems Inform. Transmission, 40:1 (2004), 1–4  mathnet  crossref  mathscinet
    2. D. S. Osipov, A. A. Frolov, V. V. Zyablov, “Multiple access system for a vector disjunctive channel”, Problems Inform. Transmission, 48:3 (2012), 243–249  mathnet  crossref  isi
    3. D. S. Osipov, A. A. Frolov, V. V. Zyablov, “On the user capacity for a multiple-access system in a vector disjunctive channel with errors”, Problems Inform. Transmission, 49:4 (2013), 308–321  mathnet  crossref  isi
    4. A. A. Frolov, V. V. Zyablov, “On the capacity of a multiple-access vector adder channel”, Problems Inform. Transmission, 50:2 (2014), 133–143  mathnet  crossref  mathscinet  isi  elib
    5. Ivanov F., Rybin P., “Novel Signal-Code Construction For Multiple Access System Over Vector-Disjunctive Channel”, Proceedings of 2018 International Symposium on Information Theory and Its Applications (Isita2018), IEEE, 2018, 560–564  crossref  isi
    6. Ivanov F., Rybin P., “On the Maximal Achievable Rate For Signal-Code Construction Based on Interleaved Reed-Solomon Codes For Multiple Access System Over Vector-Disjunctive Channel”, 2018 IEEE International Black Sea Conference on Communications and Networking (Blackseacom), International Black Sea Conference on Communications and Networking, IEEE, 2018, 148–152  isi
    7. D'yachkov A., Polyanskii N., Shchukin V., Vorobyev I., “Separable Codes For the Symmetric Multiple-Access Channel”, 2018 IEEE International Symposium on Information Theory (Isit), IEEE International Symposium on Information Theory, IEEE, 2018, 291–295  isi
    8. Ivanov F., Rybin P., 2018 IEEE International Conference on Communications Workshops (Icc Workshops), IEEE International Conference on Communications Workshops, IEEE, 2018  isi
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:394
    Full text:117
    References:19
    First page:3

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020