An application of a wringing lemma to the multiple access channel with cooperative encoders

Shirin Saeedi Bidokhti; Gerhard Kramer

doi:10.1109/IWCIT.2014.6842504

An application of a wringing lemma to the multiple access channel with cooperative encoders

Shirin Saeedi Bidokhti, Gerhard Kramer

Chair of Communications Engineering

Technical University of Munich

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

1 Scopus citations

Abstract

The problem of communicating over a multiple access channel with cooperative encoders is studied. A new upper bound is derived on the capacity which is motivated by the regime of operation where the relays start to cooperate. The proof technique is based on a wringing lemma by Dueck and Ahlswede which was used for the multiple description problem with no excess rate. Previous upper bounds are shown to be loose in general, and may be improved.

Original language	English
Title of host publication	IWCIT 2014 - Iran Workshop on Communication and Information Theory
Publisher	IEEE Computer Society
ISBN (Print)	9781479948772
DOIs	https://doi.org/10.1109/IWCIT.2014.6842504
State	Published - 2014
Event	2014 Iran Workshop on Communication and Information Theory, IWCIT 2014 - Tehran, Iran, Islamic Republic of Duration: 7 May 2014 → 8 May 2014

Publication series

Name	IWCIT 2014 - Iran Workshop on Communication and Information Theory

Conference

Conference	2014 Iran Workshop on Communication and Information Theory, IWCIT 2014
Country/Territory	Iran, Islamic Republic of
City	Tehran
Period	7/05/14 → 8/05/14

Access to Document

10.1109/IWCIT.2014.6842504

Cite this

@inproceedings{d24792194be54125a79a240476ad31b2,

title = "An application of a wringing lemma to the multiple access channel with cooperative encoders",

abstract = "The problem of communicating over a multiple access channel with cooperative encoders is studied. A new upper bound is derived on the capacity which is motivated by the regime of operation where the relays start to cooperate. The proof technique is based on a wringing lemma by Dueck and Ahlswede which was used for the multiple description problem with no excess rate. Previous upper bounds are shown to be loose in general, and may be improved.",

author = "Bidokhti, {Shirin Saeedi} and Gerhard Kramer",

year = "2014",

doi = "10.1109/IWCIT.2014.6842504",

language = "English",

isbn = "9781479948772",

series = "IWCIT 2014 - Iran Workshop on Communication and Information Theory",

publisher = "IEEE Computer Society",

booktitle = "IWCIT 2014 - Iran Workshop on Communication and Information Theory",

note = "2014 Iran Workshop on Communication and Information Theory, IWCIT 2014 ; Conference date: 07-05-2014 Through 08-05-2014",

}

Bidokhti, SS & Kramer, G 2014, An application of a wringing lemma to the multiple access channel with cooperative encoders. in IWCIT 2014 - Iran Workshop on Communication and Information Theory., 6842504, IWCIT 2014 - Iran Workshop on Communication and Information Theory, IEEE Computer Society, 2014 Iran Workshop on Communication and Information Theory, IWCIT 2014, Tehran, Iran, Islamic Republic of, 7/05/14. https://doi.org/10.1109/IWCIT.2014.6842504

An application of a wringing lemma to the multiple access channel with cooperative encoders. / Bidokhti, Shirin Saeedi; Kramer, Gerhard.
IWCIT 2014 - Iran Workshop on Communication and Information Theory. IEEE Computer Society, 2014. 6842504 (IWCIT 2014 - Iran Workshop on Communication and Information Theory).

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

TY - GEN

T1 - An application of a wringing lemma to the multiple access channel with cooperative encoders

AU - Bidokhti, Shirin Saeedi

AU - Kramer, Gerhard

PY - 2014

Y1 - 2014

N2 - The problem of communicating over a multiple access channel with cooperative encoders is studied. A new upper bound is derived on the capacity which is motivated by the regime of operation where the relays start to cooperate. The proof technique is based on a wringing lemma by Dueck and Ahlswede which was used for the multiple description problem with no excess rate. Previous upper bounds are shown to be loose in general, and may be improved.

AB - The problem of communicating over a multiple access channel with cooperative encoders is studied. A new upper bound is derived on the capacity which is motivated by the regime of operation where the relays start to cooperate. The proof technique is based on a wringing lemma by Dueck and Ahlswede which was used for the multiple description problem with no excess rate. Previous upper bounds are shown to be loose in general, and may be improved.

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

U2 - 10.1109/IWCIT.2014.6842504

DO - 10.1109/IWCIT.2014.6842504

M3 - Conference contribution

AN - SCOPUS:84904540707

SN - 9781479948772

T3 - IWCIT 2014 - Iran Workshop on Communication and Information Theory

BT - IWCIT 2014 - Iran Workshop on Communication and Information Theory

PB - IEEE Computer Society

T2 - 2014 Iran Workshop on Communication and Information Theory, IWCIT 2014

Y2 - 7 May 2014 through 8 May 2014

ER -

An application of a wringing lemma to the multiple access channel with cooperative encoders

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this