Broadcast channels with cooperating decoders

Ron Dabora; Sergio D. Servetto

doi:10.1109/TIT.2006.885478

Broadcast channels with cooperating decoders

Ron Dabora, Sergio D. Servetto

Research output: Contribution to journal › Article › peer-review

126 Scopus citations

Abstract

We consider the problem of communicating over the general discrete memoryless broadcast channel (DMBC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper, we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case.

Original language	English
Pages (from-to)	5438-5454
Number of pages	17
Journal	IEEE Transactions on Information Theory
Volume	52
Issue number	12
DOIs	https://doi.org/10.1109/TIT.2006.885478
State	Published - 1 Dec 2006
Externally published	Yes

Keywords

Broadcast channels
Channel capacity
Cooperative broadcast
Network information theory
Relay channels

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/TIT.2006.885478

Cite this

@article{b31d83cec43d4b5bacd2cb51f4bfe88f,

title = "Broadcast channels with cooperating decoders",

abstract = "We consider the problem of communicating over the general discrete memoryless broadcast channel (DMBC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper, we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case.",

keywords = "Broadcast channels, Channel capacity, Cooperative broadcast, Network information theory, Relay channels",

author = "Ron Dabora and Servetto, {Sergio D.}",

note = "Funding Information: Manuscript received May 11, 2005; revised March 29, 2006. This work was supported by the National Science Foundation under awards CCR-0238271 (CAREER), CCR-0330059, and ANR-0325556. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Chicago, IL June/July 2004 and at the IEEE International Symposium on Information Theory, Adelaide, Australia, September 2005.",

year = "2006",

month = dec,

day = "1",

doi = "10.1109/TIT.2006.885478",

language = "English",

volume = "52",

pages = "5438--5454",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "12",

}

TY - JOUR

T1 - Broadcast channels with cooperating decoders

AU - Dabora, Ron

AU - Servetto, Sergio D.

N1 - Funding Information: Manuscript received May 11, 2005; revised March 29, 2006. This work was supported by the National Science Foundation under awards CCR-0238271 (CAREER), CCR-0330059, and ANR-0325556. The material in this paper was presented in part at the IEEE International Symposium on Information Theory, Chicago, IL June/July 2004 and at the IEEE International Symposium on Information Theory, Adelaide, Australia, September 2005.

PY - 2006/12/1

Y1 - 2006/12/1

N2 - We consider the problem of communicating over the general discrete memoryless broadcast channel (DMBC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper, we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case.

AB - We consider the problem of communicating over the general discrete memoryless broadcast channel (DMBC) with partially cooperating receivers. In our setup, receivers are able to exchange messages over noiseless conference links of finite capacities, prior to decoding the messages sent from the transmitter. In this paper, we formulate the general problem of broadcast with cooperation. We first find the capacity region for the case where the BC is physically degraded. Then, we give achievability results for the general broadcast channel, for both the two independent messages case and the single common message case.

KW - Broadcast channels

KW - Channel capacity

KW - Cooperative broadcast

KW - Network information theory

KW - Relay channels

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

U2 - 10.1109/TIT.2006.885478

DO - 10.1109/TIT.2006.885478

M3 - Article

AN - SCOPUS:33947412645

SN - 0018-9448

VL - 52

SP - 5438

EP - 5454

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 12

ER -

Broadcast channels with cooperating decoders

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this