arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.14521cs.ITmath.ITmath.PRmath.STstat.TH
收藏

一般信道的混合覆盖问题

Minoration via Mixed Volumes and Cover's Problem for General Channels

Jingbo Liu

摘要:

本文对Thomas Cover在1987年提出的关于一般离散无记忆环境下中继信道容量的公开问题给出了完整的解决方案,而没有任何附加的假设。该方法的关键步骤是利用凸几何方法求出随机过程的软极大值的下界,其思想有两个:首先,通过用顶点数有界的多面体逼近凸集,软极大值是另一过程的上确界的下界.其次,利用Pajor的一个结果,通过混合体积不等式(Minkowski第一不等式),证明了过程的上确界是关于填充数的下界。

英文摘要:

We give a complete solution to an open problem of Thomas Cover in 1987 about the capacity of a relay channel in the general discrete memoryless setting without any additional assumptions. The key step in our approach is to lower bound a certain soft-max of a stochastic process by convex geometry methods, which is based on two ideas: First, the soft-max is lower bounded in terms of the supremum of another process, by approximating a convex set with a polytope with bounded number of vertices. Second, using a result of Pajor, the supremum of the process is lower bounded in terms of packing numbers by means of mixed-volume inequalities (Minkowski's first inequality).

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

↑