Joint source-channel with side information coding error exponents
| dc.creator | Chang, Cheng | |
| dc.date | 2009-01-23 | |
| dc.date.accessioned | 2026-07-07T12:33:39Z | |
| dc.date.available | 2026-07-07T12:33:39Z | |
| dc.description | 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. | |
| dc.description | In preparation for IEEE Transactions on IT | |
| dc.identifier | https://arxiv.org/abs/0901.3596 | |
| dc.identifier | http://arxiv.org/abs/0901.3596 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/217203 | |
| dc.subject | Information Theory | |
| dc.title | Joint source-channel with side information coding error exponents | |
| dc.type | text |