Joint source-channel with side information coding error exponents
Keyword(s): joint source channel coding, side information, error exponent
Abstract: 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 Csiszár's classical paper . Unlike the joint source-channel coding result in , 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.
Additional Publication Information: Submitted to IEEE Transactions on Information Theory, Allerton Conference 2009
External Posting Date: February 6, 2009 [Fulltext]. Approved for External Publication
Internal Posting Date: February 6, 2009 [Fulltext]