By Topic

Achievable Error Exponents for Channels With Side Information—Erasure and List Decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Erez Sabbag ; Department of Electrical Engineering, Technion?Israel Institute of Technology, Haifa, Israel ; Neri Merhav

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, a universally achievable region of error exponents is 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. An achievable region of 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 and a modified analysis.

Published in:

IEEE Transactions on Information Theory  (Volume:56 ,  Issue: 11 )