Computer Science – Information Theory
Scientific paper
2011-10-01
Computer Science
Information Theory
22 pages, 3 figures
Scientific paper
In this paper, we derive information-theoretic performance limits for three classes of two-user state-dependent discrete memoryless broadcast channels, with noncausal side-information at the encoder. The first class of channels comprises a sender broadcasting two independent messages to two non-cooperating receivers; for channels of the second class, each receiver is given the message it need not decode; and the third class comprises channels where the sender is constrained to keep each message confidential from the unintended receiver. To derive inner bounds, we employ an extension of Marton's achievability scheme for the classical two-user broadcast channel, results from the second moment method, an extension of the technique proposed by Kramer and Shamai for broadcast channels with receiver side-information, and stochastic encoders to satisfy confidentiality requirements. Outer bounds are derived by following the procedure used to prove the converse theorem for Gel'fand-Pinsker's channels with random parameters; and confidentiality constraints are utilized for deriving outer bounds for channels belonging to the third class. For channels of the second class, the bounds are tight, thereby yielding the capacity region.
Kishore Shalinee
Murthy Chandra R.
Nagananda K. G.
No associations
LandOfFree
On State-Dependent Broadcast Channels, with Side-Information at the Transmitter does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On State-Dependent Broadcast Channels, with Side-Information at the Transmitter, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On State-Dependent Broadcast Channels, with Side-Information at the Transmitter will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-283695