ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D⊆F219D\subseteq\mathbb F_2^{19} be the fixed 4096-word ambient binary linear code used in Ho’s 19-dimensional improvement of the Cohn–Li kissing construction. Is every subset A⊆DA\subseteq D with minimum Hamming distance at least 55 of size at most 12801280? No linearity assumption is imposed on AA.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.