On the binary codes with parameters of doubly-shortened 1-perfect codes (Q2638426)

The main consideration of this paper is to address the following problem for which the author gives a partial answer and open perspectives: Whether every \((2^k-3, 2^{2^k-3-k}, 3)\) code is a doubly-shortened 1-perfect code? The author constructs an interesting design `unsplittable twofold Steiner triple system' whose completing to twofold 1-perfect code would mean the negative answer to the main problem. A connection between the main problem and the problem of completing Latin hypercuboids of order 4 (quaternary distance-2 MDS codes) is shown. An equivalent formulation of the main problem in terms of distance-4 codes is also discussed.