Multiple access channel with unreliable cribbing

Wasim Huleihel; Yossef Steinberg

doi:10.1109/ISIT.2016.7541547

Multiple access channel with unreliable cribbing

Wasim Huleihel, Yossef Steinberg

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

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 language	English
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers
Pages	1491-1495
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541547
State	Published - 10 Aug 2016
Externally published	Yes
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Conference

Conference	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	10/07/16 → 15/07/16

Keywords

Cooperation
cribbing
multiple access channel
unreliable cooperation

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2016.7541547

Cite this

Huleihel, W., & Steinberg, Y. (2016). Multiple access channel with unreliable cribbing. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 1491-1495). Article 7541547 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT.2016.7541547

@inproceedings{fd66324e5f344ab0a8062bc488dacca6,

title = "Multiple access channel with unreliable cribbing",

abstract = "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.",

keywords = "Cooperation, cribbing, multiple access channel, unreliable cooperation",

author = "Wasim Huleihel and Yossef Steinberg",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541547",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers",

pages = "1491--1495",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

address = "United States",

}

Huleihel, W & Steinberg, Y 2016, Multiple access channel with unreliable cribbing. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541547, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers, pp. 1491-1495, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10/07/16. https://doi.org/10.1109/ISIT.2016.7541547

Multiple access channel with unreliable cribbing. / Huleihel, Wasim; Steinberg, Yossef.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers, 2016. p. 1491-1495 7541547 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Multiple access channel with unreliable cribbing

AU - Huleihel, Wasim

AU - Steinberg, Yossef

PY - 2016/8/10

Y1 - 2016/8/10

N2 - 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.

AB - 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.

KW - Cooperation

KW - cribbing

KW - multiple access channel

KW - unreliable cooperation

UR - http://www.scopus.com/inward/record.url?scp=84985990190&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2016.7541547

DO - 10.1109/ISIT.2016.7541547

M3 - Conference contribution

AN - SCOPUS:84985990190

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1491

EP - 1495

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

Multiple access channel with unreliable cribbing

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this