Separable Codes for the Symmetric Multiple-Access Channel

Arkadii D'Yachkov, Nikita Polyanskii, Vladislav Shchukin, Ilya Vorobyev

    Research output: Contribution to journalArticlepeer-review

    4 Citations (Scopus)

    Abstract

    A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC) if Boolean sums of sets of s columns are all distinct. The well-known issue of the combinatorial coding theory is to obtain upper and lower bounds on the rate of s-separable codes for the disj-MAC. In our paper, we generalize the problem and discuss upper and lower bounds on the rate of q-ary s-separable codes for the models of noiseless symmetric MAC, i.e., at each time instant the output signal of MAC is a symmetric function of its s input signals.

    Original languageEnglish
    Article number8620292
    Pages (from-to)3738-3750
    Number of pages13
    JournalIEEE Transactions on Information Theory
    Volume65
    Issue number6
    DOIs
    Publication statusPublished - Jun 2019

    Keywords

    • list-decoding
    • Multiple-access channel (MAC)
    • random coding method
    • separable codes

    Fingerprint

    Dive into the research topics of 'Separable Codes for the Symmetric Multiple-Access Channel'. Together they form a unique fingerprint.

    Cite this