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
Secure Password Storage: Why Applications Should Never Store Plain-Text Passwords
0dev.to OpenSource
Perplexity Decider v1.3 Open Weights Beat Jev 1.14
0dev.to OpenSource
I Measured My MCP Server's Context Tax Before Adding a Third Tool
0dev.to OpenSource

Let your coding agent test the API it just wrote
0dev.to OpenSource

Inside Stripe’s AI Coding Interview: Rule Engines, AI Prompts, and Tests
0dev.to Programming
From Idea to Wireframe to Production Design: An Open-Source Product Blueprint Guide
0dev.to Programming