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, 2018, Volume 54, Issue 2, Pages 20–28 (Mi ppi2264)  
This article is cited in 2 scientific papers (total in 2 papers)

Coding Theory

Compositional restricted multiple access channel

E. E. Egorova, V. S. Potapova

Skolkovo Institute of Science and Technology, Moscow, Russia
Full-text PDF (196 kB) Citations (2)
References:
PDF
HTML
Abstract: We introduce the notion of a $q$-ary $s$-compositional code and prove that the rate, $R$, of the best such code satisfies for large $s$ the asymptotic inequalities
$$ (q-1)\frac{\log_qs}{4s}\lesssim R\lesssim2(q-1)\frac{\log_qs}{4s}. $$
Funding agency Grant number
Simons Foundation
Supported in part by the Simons Foundation.
Received: 26.04.2016
Revised: 17.01.2018
English version:
Problems of Information Transmission, 2018, Volume 54, Issue 2, Pages 116–123
DOI: https://doi.org/10.1134/S0032946018020023
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: E. E. Egorova, V. S. Potapova, “Compositional restricted multiple access channel”, Probl. Peredachi Inf., 54:2 (2018), 20–28; Problems Inform. Transmission, 54:2 (2018), 116–123
Citation in format AMSBIB
\Bibitem{EgoPot18}
\by E.~E.~Egorova, V.~S.~Potapova
\paper Compositional restricted multiple access channel
\jour Probl. Peredachi Inf.
\yr 2018
\vol 54
\issue 2
\pages 20--28
\mathnet{http://mi.mathnet.ru/ppi2264}
\elib{https://elibrary.ru/item.asp?id=35767123}
\transl
\jour Problems Inform. Transmission
\yr 2018
\vol 54
\issue 2
\pages 116--123
\crossref{https://doi.org/10.1134/S0032946018020023}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000438828500002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85050021898}
Linking options:
  • https://www.mathnet.ru/eng/ppi2264
  • https://www.mathnet.ru/eng/ppi/v54/i2/p20
    • This publication is cited in the following 2 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:261
    Full-text PDF :35
    References:40
    First page:7
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024