Separable Codes for the Symmetric Multiple-Access Channel

Arkadii Dyachkov, Nikita Polyanskii, Vladislav Shchukin, Ilya Vorobyev

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 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 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
    Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages291-295
    Number of pages5
    ISBN (Print)9781538647806
    DOIs
    Publication statusPublished - 15 Aug 2018
    Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
    Duration: 17 Jun 201822 Jun 2018

    Publication series

    NameIEEE International Symposium on Information Theory - Proceedings
    Volume2018-June
    ISSN (Print)2157-8095

    Conference

    Conference2018 IEEE International Symposium on Information Theory, ISIT 2018
    Country/TerritoryUnited States
    CityVail
    Period17/06/1822/06/18

    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