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

编码理论中的线性规划层次:对偶解

Linear Programming Hierarchies in Coding Theory: Dual Solutions

Elyassaf Loyfer, Nati Linial

摘要:

速率与距离问题是编码理论中一个长期存在的开放问题。最近的论文提出了一种新的方法来解决这个问题,呼吁一个新的层次结构的线性规划。如果可以找到这些LP的好的对偶解,这将导致线性码的速率与距离问题的上界得到改进。在这项工作中,我们开发了第一个双重可行的解决方案,在这个层次的LP。这些匹配的最知名的边界为广泛的参数。我们希望这是迈向更好解决方案的第一步,并改进线性码的速率与距离问题的上限。

英文摘要:

The rate vs. distance problem is a long-standing open problem in coding theory. Recent papers have suggested a new way to tackle this problem by appealing to a new hierarchy of linear programs. If one can find good dual solutions to these LPs, this would result in improved upper bounds for the rate vs. distance problem of linear codes. In this work, we develop the first dual feasible solutions to the LPs in this hierarchy. These match the best-known bound for a wide range of parameters. Our hope is that this is a first step towards better solutions, and improved upper bounds for the rate vs. distance problem of linear codes.

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

↑