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., 2016, Volume 52, Issue 4, Pages 14–30 (Mi ppi2219)  

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

Information Theory

List decoding for a multiple access hyperchannel

V. Yu. Shchukinab

a Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
b Probability Theory Chair, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia

Abstract: We obtain bounds on the rate of (optimal) list-decoding codes with a fixed list size $L\ge1$ for a $q$-ary multiple access hyperchannel (MAHC) with $s\ge2$ inputs and one output. By definition, an output signal of this channel is the set of symbols of a $q$-ary alphabet that occur in at least one of the $s$ input signals. For example, in the case of a binary MAHC, where $q=2$, an output signal takes values in the ternary alphabet $\{0,1,\{0,1\}\}$; namely, it equals $0$ ($1$) if all the $s$ input signals are $0$ ($1$) and equals $\{0,1\}$ otherwise. Previously, upper and lower bounds on the code rate for a $q$-ary MAHC were studied for $L\ge1$ and $q=2$, and also for the nonbinary case $q\ge3$ for $L=1$ only, i.e., for so-called frameproof codes. Constructing upper and lower bounds on the rate for the general case of $L\ge1$ and $q\ge2$ in the present paper is based on a substantial development of methods that we designed earlier for the classical binary disjunctive multiple access channel.

Funding Agency Grant Number
Russian Science Foundation 14-50-00150
The research was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation, project no. 14-50-00150.


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

English version:
Problems of Information Transmission, 2016, 52:4, 329–343

Bibliographic databases:

UDC: 621.391.15
Received: 15.10.2015
Revised: 09.08.2016

Citation: V. Yu. Shchukin, “List decoding for a multiple access hyperchannel”, Probl. Peredachi Inf., 52:4 (2016), 14–30; Problems Inform. Transmission, 52:4 (2016), 329–343

Citation in format AMSBIB
\Bibitem{Shc16}
\by V.~Yu.~Shchukin
\paper List decoding for a~multiple access hyperchannel
\jour Probl. Peredachi Inf.
\yr 2016
\vol 52
\issue 4
\pages 14--30
\mathnet{http://mi.mathnet.ru/ppi2219}
\elib{http://elibrary.ru/item.asp?id=29472060}
\transl
\jour Problems Inform. Transmission
\yr 2016
\vol 52
\issue 4
\pages 329--343
\crossref{https://doi.org/10.1134/S0032946016040025}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000392083800002}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85008440756}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2219
  • http://mi.mathnet.ru/eng/ppi/v52/i4/p14

    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. Vorobyev, N. A. Polyanskii, V. Yu. Shchukin, “Symmetric Disjunctive List-Decoding Codes”, Designs Codes Cryptogr., 82:1-2, SI (2017), 211–229  crossref  mathscinet  zmath  isi  scopus
    2. A. D'yachkov, N. Polyanskii, V. Shchukin, I. Vorobyev, “Separable codes for the symmetric multiple-access channel”, 2018 IEEE International Symposium on Information Theory (ISIT), IEEE, 2018, 291–295  crossref  isi
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:172
    Full text:5
    References:20
    First page:13

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