An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder

Details An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder

2010-04-20

arxiv.org/abs/1004.3427v2

Computer Science

Information Theory

11 pages

Scientific paper

A new achievability scheme for the compound channel with discrete memoryless (DM) state noncausally available at the encoder is established. Achievability is proved using superposition coding, Marton coding, joint typicality encoding, and indirect decoding. The scheme is shown to achieve strictly higher rate than the straightforward extension of the Gelfand-Pinsker coding scheme for a single DMC with DM state, and is optimal for some classes of channels.

Affiliated with

Also associated with

No associations

Rating

An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder 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 An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-472651