Abstract
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 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. 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 Csiszar and Korner'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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
