On perfect codes that do not contain Preparata-like codes
Abstract
We show that for every length of form 4k-1, there exists a binary 1-perfect code that does not include any Preparata-like code.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.