On perfect codes that do not contain Preparata-like codes

Abstract

We show that for every length of form $4^k-1$, there exists a binary $1$-perfect code that does not include any Preparata-like code.

arXiv commentEng. 4pp + Rus. 5pp. v.2: English translation added. v.3: accepted version (minor revision, more explanations in some places)