Achievable error exponents for channel with side information — erasure and list decoding

We consider a decoder with an erasure option and a variable size list decoder for channels with non-causal side information at the transmitter. First, universally achievable error exponents are offered for decoding with an erasure option using a parameterized decoder in the spirit of Csiszar and Korner's decoder. Then, the proposed decoding rule is generalized by extending the range of its parameters to allow variable size list decoding. This extension gives a unified treatment for erasure/list decoding. Exponential bounds on the probability of list error and the average number of incorrect messages on the list are given. Relations to Forney's and Csiszar and Korner's decoders for DMC are discussed. These results are obtained by exploring a random binning code with conditionally constant composition codewords proposed by Moulin and Wang, but with a different decoder.

[1]  Emre Telatar,et al.  Exponential bounds for list size moments and error probability , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).

[2]  Emre Telatar,et al.  Multi-access communications with decision feedback decoding , 1992 .

[3]  Ying Wang,et al.  Blind Fingerprinting , 2008, ArXiv.

[4]  Ying Wang,et al.  Capacity and Random-Coding Exponents for Channel Coding With Side Information , 2007, IEEE Transactions on Information Theory.

[5]  G. David Forney,et al.  Exponential error bounds for erasure, list, and decision feedback schemes , 1968, IEEE Trans. Inf. Theory.

[6]  Robert G. Gallager,et al.  New exponential upper bounds to error and erasure probabilities , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[7]  Ying Wang,et al.  Error exponents for channel coding with side information , 2004, Information Theory Workshop.

[8]  Pierre Moulin A Neyman-Pearson approach to universal erasure and list decoding , 2008, 2008 IEEE International Symposium on Information Theory.