跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24997 · v1

There is no binary linear $[65,9,29]$ code

首次提交 2026-11-18 23:05
版本更新 2026-11-18 23:05
雷达观测 2026-11-21 12:18
arXiv ↗PDF ↗

摘要

We prove that no binary linear [65,9,⩾29][65,9,\geqslant29] code exists, equivalently, that no even binary linear [66,9,⩾30][66,9,\geqslant30] code exists. Together with known constructions, this determines d2(65,9)=28d_2(65,9)=28, n2(9,29)=66n_2(9,29)=66, and n2(9,30)=67n_2(9,30)=67. A residual-code bound and a known construction also give d2(122,10)=56d_2(122,10)=56. To prove nonexistence, we associate with a hypothetical even code a quadratic function derived from half the codeword weight modulo 22. Its polar form determines the fourth derivative of a Boolean function of degree at most four. Character sums, weight moments, and the exclusion of weight-4242 codewords give upper bounds on the support of this function in seven cases. Restrictions to nondegenerate affine subspaces exclude six cases. In the remaining case, equality would force four distinct coordinate functionals to be identically 11 on an affine seven-space, although at most two can have this property. The argument uses published minimum-length results for binary linear codes of dimensions eight and nine.

作者备注:10 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 23:05 · 最新观测版本

There is no binary linear $[65,9,29]$ code

We prove that no binary linear [65,9,⩾29][65,9,\geqslant29] code exists, equivalently, that no even binary linear [66,9,⩾30][66,9,\geqslant30] code exists. Together with known constructions, this determines d2(65,9)=28d_2(65,9)=28, n2(9,29)=66n_2(9,29)=66, and n2(9,30)=67n_2(9,30)=67. A residual-code bound and a known construction also give d2(122,10)=56d_2(122,10)=56. To prove nonexistence, we associate with a hypothetical even code a quadratic function derived from half the codeword weight modulo 22. Its polar form determines the fourth derivative of a Boolean function of degree at most four. Character sums, weight moments, and the exclusion of weight-4242 codewords give upper bounds on the support of this function in seven cases. Restrictions to nondegenerate affine subspaces exclude six cases. In the remaining case, equality would force four distinct coordinate functionals to be identically 11 on an affine seven-space, although at most two can have this property. The argument uses published minimum-length results for binary linear codes of dimensions eight and nine.

查看此版本解读 →查看此版本原文 ↗