On degraded two-message set broadcast

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case where at most two receivers do not require the private message, we give an exact characterization of the capacity region, where achievability is through linear coding.


Presented at:
IEEE Information Theory Workshop (ITW 2009), Taormina, Italy, October 11-16, 2009
Year:
2009
Laboratories:




 Record created 2012-01-26, last modified 2018-03-18

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)