Optimality of the added-vector code in the 19-dimensional kissing construction
Statement
Let 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 with minimum Hamming distance at least of size at most ? No linearity assumption is imposed on .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.