Joint source-channel with side information coding error exponents

Details Joint source-channel with side information coding error exponents Joint source-channel with side information coding error exponents

2009-01-23

arxiv.org/abs/0901.3596v1

Computer Science

Information Theory

In preparation for IEEE Transactions on IT

Scientific paper

In this paper, we study the upper and the lower bounds on the joint source-channel coding error exponent with decoder side-information. The results in the paper are non-trivial extensions of the Csiszar's classical paper [5]. Unlike the joint source-channel coding result in [5], it is not obvious whether the lower bound and the upper bound are equivalent even if the channel coding error exponent is known. For a class of channels, including the symmetric channels, we apply a game-theoretic result to establish the existence of a saddle point and hence prove that the lower and upper bounds are the same if the channel coding error exponent is known. More interestingly, we show that encoder side-information does not increase the error exponents in this case.

Affiliated with

Also associated with

No associations

Rating

Joint source-channel with side information coding error exponents 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 Joint source-channel with side information coding error exponents, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Joint source-channel with side information coding error exponents will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65517