On mobile sets in the binary hypercube
Abstract
If two distance-3 codes have the same neighborhood, then each of them is called a mobile set. In the (4k+3)-dimensional binary hypercube, there exists a mobile set of cardinality 2*6k that cannot be split into mobile sets of smaller cardinalities or represented as a natural extension of a mobile set in a hypercube of smaller dimension. Keywords: mobile set; 1-perfect 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.