pith. sign in

arxiv: cs/0505032 · v3 · pith:N22NH6LAnew · submitted 2005-05-11 · 💻 cs.IT · math.IT

Broadcast Channels with Cooperating Decoders

classification 💻 cs.IT math.IT
keywords broadcastcasegeneralmessageschannelcooperatingproblemreceivers
0
0 comments X
read the original abstract

We consider the problem of communicating over the general discrete memoryless broadcast channel (BC) 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.