TY - GEN

T1 - Error exponents for channel coding with side information

AU - Moulin, Pierre

AU - Wang, Ying

PY - 2004

Y1 - 2004

N2 - Capacity formulas and random-coding and sphere-packing exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. Information is to be reliably transmitted through a noisy channel with random state sequence. Partial information about the state sequence is available to the encoder and decoder. Two families of channels are considered: 1) compound discrete memoryless channels (C-DMC), and 2) channels with arbitrary memory, subject to an additive cost constraint, or more generally to a constraint on the conditional type of the channel output given the input. Both problems are closely connected. For the C-DMC case, our random-coding and sphere-packing exponents coincide at high rates, thereby determining the reliability function of the channel family. The random-coding exponent is achieved using a 3-D binning scheme and a maximum penalized mutual information decoder. In the case of arbitrary channels with memory, a larger random-coding error exponent than in the C-DMC case is obtained. Applications of this study include watermarking, data hiding, communication in presence of partially known interferers, and problems such as broadcast channels, all of which involve the fundamental idea of binning.

AB - Capacity formulas and random-coding and sphere-packing exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. Information is to be reliably transmitted through a noisy channel with random state sequence. Partial information about the state sequence is available to the encoder and decoder. Two families of channels are considered: 1) compound discrete memoryless channels (C-DMC), and 2) channels with arbitrary memory, subject to an additive cost constraint, or more generally to a constraint on the conditional type of the channel output given the input. Both problems are closely connected. For the C-DMC case, our random-coding and sphere-packing exponents coincide at high rates, thereby determining the reliability function of the channel family. The random-coding exponent is achieved using a 3-D binning scheme and a maximum penalized mutual information decoder. In the case of arbitrary channels with memory, a larger random-coding error exponent than in the C-DMC case is obtained. Applications of this study include watermarking, data hiding, communication in presence of partially known interferers, and problems such as broadcast channels, all of which involve the fundamental idea of binning.

UR - http://www.scopus.com/inward/record.url?scp=19544377637&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=19544377637&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:19544377637

SN - 0780387201

T3 - 2004 IEEE Information Theory Workshop - Proceedings, ITW

SP - 353

EP - 358

BT - 2004 IEEE Information Theory Workshop - Proceedings, ITW

T2 - 2004 IEEE Information Theory Workshop - Proceedings, ITW

Y2 - 24 October 2004 through 29 October 2004

ER -