The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function

Details The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function

2009-10-04

arxiv.org/abs/0910.0653v1

Computer Science

Information Theory

4 pages, Presented at the ISIT 2009

Scientific paper

We consider a Gelfand-Pinsker discrete memoryless channel (DMC) model and provide a strong converse for its capacity. The strong converse is then used to obtain an upper bound on the reliability function. Instrumental in our proofs is a new technical lemma which provides an upper bound for the rate of codes with codewords that are conditionally typical over large message dependent subsets of a typical set of state sequences. This technical result is a nonstraightforward analog of a known result for a DMC without states that provides an upper bound on the rate of a good code with codewords of a fixed type (to be found in, for instance, the Csiszar-Korner book).

Affiliated with

Also associated with

No associations

Rating

The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function 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 The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Gelfand-Pinsker Channel: Strong Converse and Upper Bound for the Reliability Function will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9201