Computer Science – Information Theory
Scientific paper
2009-03-12
Computer Science
Information Theory
Submitted to IEEE Trans. Inform. Theory, March 2009
Scientific paper
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\'{a}r and K\"{o}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\'{a}r and K\"{o}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.
Merhav Neri
Sabbag Erez
No associations
LandOfFree
Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-36760