RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

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., 2013, Volume 49, Issue 4, Pages 3–12 (Mi ppi2119)  

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

Coding Theory

Multiple-access hyperchannel

L. A. Bassalygoa, V. V. Rykovb

a Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
b Department of Mathematics, University of Nebraska, Omaha, USA

Abstract: We derive an asymptotic upper bound on the decoding failure probability for an MDS code in a $q$-ary multiple access channel.

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

English version:
Problems of Information Transmission, 2013, 49:4, 299–307

Bibliographic databases:

UDC: 621.391.15
Received: 18.04.2013
Revised: 02.09.2013

Citation: L. A. Bassalygo, V. V. Rykov, “Multiple-access hyperchannel”, Probl. Peredachi Inf., 49:4 (2013), 3–12; Problems Inform. Transmission, 49:4 (2013), 299–307

Citation in format AMSBIB
\Bibitem{BasRyk13}
\by L.~A.~Bassalygo, V.~V.~Rykov
\paper Multiple-access hyperchannel
\jour Probl. Peredachi Inf.
\yr 2013
\vol 49
\issue 4
\pages 3--12
\mathnet{http://mi.mathnet.ru/ppi2119}
\elib{http://elibrary.ru/item.asp?id=21915392}
\transl
\jour Problems Inform. Transmission
\yr 2013
\vol 49
\issue 4
\pages 299--307
\crossref{https://doi.org/10.1134/S0032946013040017}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000330766500001}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84897979396}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2119
  • http://mi.mathnet.ru/eng/ppi/v49/i4/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. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Almost disjunctive list-decoding codes”, Problems Inform. Transmission, 51:2 (2015), 110–131  mathnet  crossref  isi  elib
    2. N. A. Polyansky, “Almost cover-free codes”, Problems Inform. Transmission, 52:2 (2016), 142–155  mathnet  crossref  mathscinet  isi  elib  elib
    3. V. Yu. Shchukin, “List decoding for a multiple access hyperchannel”, Problems Inform. Transmission, 52:4 (2016), 329–343  mathnet  crossref  isi  elib
    4. A. De Bonis, U. Vaccaro, “Epsilon-Almost Selectors and Their Applications to Multiple-Access Communication”, IEEE Trans. Inf. Theory, 63:11 (2017), 7304–7319  crossref  mathscinet  zmath  isi  scopus
    5. A. D'yachkov, I. Vorobyev, N. Polyanskii, V. Shchukin, “Almost Cover-Free Codes and Designs”, Designs Codes Cryptogr., 82:1-2, SI (2017), 231–247  crossref  mathscinet  zmath  isi  scopus
    6. A. Barg, A. Mazumdar, “Group Testing Schemes From Codes and Designs”, IEEE Trans. Inf. Theory, 63:11 (2017), 7131–7141  crossref  mathscinet  zmath  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:290
    Full text:69
    References:47
    First page:39

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