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

关于一类最优自对偶码的存在性

On the Existence of Certain Optimal Self-Dual Codes with Lengths Between $74$ and $116$

Tao Zhang, Jerod Michel, Tao Feng, Gennian Ge

摘要:

最优二元自对偶码的存在性是一个长期的研究问题。本文给出了具有二面体自同构群$D_{2p}$的二元自对偶码的分解的一些结果,其中$D_{2p}$是素数。这些结果被用来构造新的长度为$78$或$116$的自对偶码。我们得到了$16$不等价的自对偶$[78,39,14]$码,其中四个码具有新的权枚举数。我们还证明了至少有$141$不等价的自对偶$[116,58,18]$码,其中大部分是新的等价。同时,对单偶自对偶码的重量计数器给出了一些限制。我们利用这些限制来排除一些可能的重量枚举长度为$74$,$76$,$82$,$98$和$100$的自对偶码。

英文摘要:

The existence of optimal binary self-dual codes is a long-standing research problem. In this paper, we present some results concerning the decomposition of binary self-dual codes with a dihedral automorphism group $D_{2p}$, where $p$ is a prime. These results are applied to construct new self-dual codes with length $78$ or $116$. We obtain $16$ inequivalent self-dual $[78,39,14]$ codes, four of which have new weight enumerators. We also show that there are at least $141$ inequivalent self-dual $[116,58,18]$ codes, most of which are new up to equivalence. Meanwhile, we give some restrictions on the weight enumerators of singly even self-dual codes. We use these restrictions to exclude some possible weight enumerators of self-dual codes with lengths $74$, $76$, $82$, $98$ and $100$.

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

↑