arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.02945math.CO
收藏

编码理论中的新方法:纠错码与Shannon容量

New Methods in Coding Theory: Error-Correcting Codes and the Shannon Capacity

Sven Polak

摘要:

在这篇论文中,我们提出了编码理论中关于纠错码和香农容量的几个结果。1.本文给出了编码理论中半定程序矩阵的一般对称约化。2.我们应用对称性减少有效地计算半定规划上限配备了汉明距离(联合工作与巴特Litjens和莱克斯Schrijver),与李距离和二进制等重码的非二进制纠错码。3.我们探索其他方法来找到新的上限与汉明距离的非二进制码,组合整除参数的基础上。4.我们研究的唯一性和分类的代码,使用半定规划求解器的输出。我们的大多数分类结果都与二进制Golay码的子码有关。这是与安德里斯·布劳威尔的合作。5.我们考虑循环图的香农容量。循环图$C_{d,q}$是顶点集为$\mathbb{Z}_q$(q阶循环群)的图,其中两个不同的顶点相邻当且仅当它们的距离(mod $q$)严格小于$d$。可以看出$C_{d,q}$的香农容量仅取决于分数q/d。证明了赋予每个有理数$q/d$以$C_{d,q}$的Shannon容量的函数在整数点$q/d$上是连续的.此外,我们给出了$7$ -圈的Shannon容量的一个新的下界.这是我和莱克斯·施里弗的合作这篇论文是写在阿姆斯特丹大学的监督下,莱克斯Schrijver。

英文摘要:

In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the symmetry reduction to efficiently compute semidefinite programming upper bounds for nonbinary error-correcting codes equipped with the Hamming distance (joint work with Bart Litjens and Lex Schrijver), with the Lee distance and for binary constant weight codes. 3. We explore other methods to find new upper bounds for nonbinary codes with the Hamming distance, based on combinatorial divisibility arguments. 4. We study uniqueness and classification of codes, using the output of the semidefinite programming solver. Most of our classification results are related to subcodes of the binary Golay code. This is joint work with Andries Brouwer. 5. We consider the Shannon capacity of circular graphs. The circular graph $C_{d,q}$ is the graph with vertex set $\mathbb{Z}_q$ (the cyclic group of order q) in which two distinct vertices are adjacent if and only if their distance (mod $q$) is strictly less than $d$. The Shannon capacity of $C_{d,q}$ can be seen to only depend on the fraction q/d. We prove that the function which assigns to each rational number $q/d$ the Shannon capacity of $C_{d,q}$ is continuous at integer points $q/d$. Moreover, we give a new lower bound on the Shannon capacity of the $7$-cycle. This is joint work with Lex Schrijver. This thesis was written at the University of Amsterdam under supervision of Lex Schrijver.

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

↑