@inproceedings{a8db82ba37d74cf7afc8513f2201b70a,
title = "Error exponents of optimum erasure/list and ordinary decoding for channels with side information",
abstract = "In this work we analyze achievable random coding error exponents pertaining to erasure/list decoding for channels with side information present at the transmitter. The analysis is carried out using the optimal decoding rule proposed by Forney. A key ingredient in the analysis is the evaluation of moments of a certain distance enumerator. This approach leads to a new exponentially tight bounds. These results are obtained by exploring a random binning code with conditionally constant composition codewords previously proposed by Moulin and Wang. Later, these results are used to obtain an achievable random coding error exponent for ordinary decoding.",
author = "Erez Sabbag and Neri Merhav",
year = "2012",
doi = "10.1109/ISIT.2012.6284064",
language = "الإنجليزيّة",
isbn = "9781467325790",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "2939--2943",
booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",
note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",
}