Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding
| dc.creator | Sabbag, Erez | |
| dc.creator | Merhav, Neri | |
| dc.date | 2009-03-12 | |
| dc.date.accessioned | 2026-07-07T12:51:55Z | |
| dc.date.available | 2026-07-07T12:51:55Z | |
| dc.description | We consider a decoder with an erasure option and a variable size list decoder for channels with non-casual 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 Csiszár and Körner'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 Csiszár and Körner's decoders for discrete memoryless channel 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 decoding rule. | |
| dc.description | Submitted to IEEE Trans. Inform. Theory, March 2009 | |
| dc.identifier | https://arxiv.org/abs/0903.2203 | |
| dc.identifier | http://arxiv.org/abs/0903.2203 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/223143 | |
| dc.subject | Information Theory | |
| dc.title | Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding | |
| dc.type | text |