arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1607.05064cs.ITmath.COmath.IT
收藏

打字机通道可靠性的界限

Bounds on the Reliability of a Typewriter Channel

Marco Dalai, Yury Polyanskiy

摘要:

本文给出了具有5个输入和交叉概率$1/2$的打字机信道的可靠性函数的新界。下限是更多的理论比实际的重要性,它提高了非常轻微的删除范围,提供了一个反例的猜想,其紧密性香农,加拉格尔和Berlekamp不需要建设代数几何码以前使用的卡茨曼,Tsfasman和Vllaughdupe。上界是通过使用线性规划界的自适应推导出来的,它基本上是有用的,作为一个低速率锚的直线界。

英文摘要:

We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability $1/2$. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound, providing a counterexample to a conjecture on its tightness by Shannon, Gallager and Berlekamp which does not need the construction of algebraic-geometric codes previously used by Katsman, Tsfasman and Vlăduţ. The upper bound is derived by using an adaptation of the linear programming bound and it is essentially useful as a low-rate anchor for the straight line bound.

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

↑