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

布尔纳舍夫可靠性的简单逆命题

A Simple Converse of Burnashev's Reliability

Peter Berlin, Baris Nakiboglu, Bixio Rimoldi, Emre Telatar

摘要:

在1976年发表的一篇引人注目的论文中,Burnashev确定了具有反馈的离散无记忆信道上变长分组码的可靠性函数。随后,Yamamoto和Itoh通过一个特别简单和有指导意义的方案获得了另一个可验证性证明。他们的想法是在通信和确认阶段之间交替,直到接收方检测到发送方用来确认消息正确的码字。我们提供了一个相反的,平行的Yamamoto-Itoh可扩展性建设。除了比原来的更简单,建议的逆表明,一个通信和确认阶段是隐含在任何计划的错误概率与最大可能的指数下降。提出的逆命题也直观地说明了为什么布尔纳舍夫指数中出现的项是必要的。

英文摘要:

In a remarkable paper published in 1976, Burnashev determined the reliability function of variable-length block codes over discrete memoryless channels with feedback. Subsequently, an alternative achievability proof was obtained by Yamamoto and Itoh via a particularly simple and instructive scheme. Their idea is to alternate between a communication and a confirmation phase until the receiver detects the codeword used by the sender to acknowledge that the message is correct. We provide a converse that parallels the Yamamoto-Itoh achievability construction. Besides being simpler than the original, the proposed converse suggests that a communication and a confirmation phase are implicit in any scheme for which the probability of error decreases with the largest possible exponent. The proposed converse also makes it intuitively clear why the terms that appear in Burnashev's exponent are necessary.

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

↑