arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0903.2203cs.ITmath.IT
收藏

具有边信息的信道的可量化误差指数-擦除和列表解码

Achievable Error Exponents for Channel with Side Information - Erasure and List Decoding

Erez Sabbag, Neri Merhav

摘要:

我们考虑一个解码器的擦除选项和一个可变大小的列表解码器的信道与非偶然的边信息在发射机。首先,普遍可实现的错误指数提供了一个擦除选项使用参数化的解码器的精神Csiszár和Körner的解码器的解码。然后,建议的解码规则一般化,通过扩展其参数的范围,以允许可变大小的列表解码。这个扩展给出了擦除/列表解码的统一处理。给出了列表错误概率和列表上错误消息的平均数的指数界。讨论了离散无记忆信道的Forney和Csiszár和Körner译码器的关系。这些结果是通过探索一个随机装箱码与条件常数组成的码字提出的莫林和王,但与不同的解码规则。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑