Backend![There is no binary linear $[65,9,29]$ code](/storage/uploads/covers/auto/p246136.svg)
There is no binary linear $[65,9,29]$ code
arXiv math.IT0 views
arXiv:2611.24997v1 Announce Type: new Abstract: We prove that no binary linear $[65,9,\geqslant29]$ code exists, equivalently, that no even binary linear $[66,9,\geqslant30]$ code exists. Together with known constructions, this determines $d_2(65,9)=28$, $n_2(9,29)=66$, and $n_2(9,30)=67$. A residual-code bound and a known construction also give $d_2(122,10)=56$. To prove nonexistence, we associate with a hypothetical even code a quadratic function derived from half the codeword weight modulo $2$. 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-$42$ 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 $1$ 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.
Source:https://arxiv.org/abs/2611.24997PreviousA human-in-the-loop Bayesian optimization framework for constraint-aware bioprocess developmentNextStructure and Complexity of Perfect Functional Representations
Related posts

PostgreSQL 19 removes the MultiXact members wall. Reclamation still waits for template0.
0dev.to
Hugging Face Breach: Security Lessons for AI Agents
0dev.to
Incus Project and Migration Trust Boundaries Need Separate Review
0dev.to

Next.js `revalidatePath` vs `revalidateTag` in 2026: Choosing the Right Cache Invalidation Primitive at Scale
0dev.to

'python' Is Not Recognized as an Internal or External Command: Every Fix
0dev.to

Xcode Instruments in Practice: Profiling and Optimizing iOS Apps
0dev.to