Multiple access channel with unreliable cribbing

Wasim Huleihel, Yossef Steinberg

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

4 Scopus citations


It is by now well-known that cooperation between users can lead to significant performance gains. A common assumption in past works is that all the users are aware of the resources available for cooperation, and know exactly to what extent these resources can be used. In this work, we consider the multiple access channel (MAC) with (strictly causal, causal, and non-causal) cribbing that may be absent. The derived achievable regions are based on universal coding scheme which exploit the cribbing link if it is present, and can still operate (although at reduced rates) if cribbing is absent. We derive also an outer bound, which for some special case is tight.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages5
ISBN (Electronic)9781509018062
StatePublished - 10 Aug 2016
Externally publishedYes
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Universitat Pompeu Fabra, Barcelona, Spain
Duration: 10 Jul 201615 Jul 2016

Publication series

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


Conference2016 IEEE International Symposium on Information Theory, ISIT 2016


FundersFunder number
Israel Science Foundation684/11


    • Cooperation
    • cribbing
    • multiple access channel
    • unreliable cooperation


    Dive into the research topics of 'Multiple access channel with unreliable cribbing'. Together they form a unique fingerprint.

    Cite this