The extended 1-perfect trades in small hypercubes

Abstract

An extended $1$-perfect trade is a pair $(T_0,T_1)$ of two disjoint binary distance-$4$ even-weight codes such that the set of words at distance $1$ from $T_0$ coincides with the set of words at distance $1$ from $T_1$. Such trade is called primary if any pair of proper subsets of $T_0$ and $T_1$ is not a trade. Using a computer-aided approach, we classify nonequivalent primary extended $1$-perfect trades of length $10$, constant-weight extended $1$-perfect trades of length $12$, and Steiner trades derived from them. In particular, all Steiner trades with parameters $(5,6,12)$ are classified.

18pp. v.3: revised; bitrades are called trades in v.3; more references

References in corpus (1)

• On mobile sets in the binary hypercube

Cited by in corpus (5)

• Minimum supports of functions on the Hamming graphs with spectral constraints
• On multifold packings of radius-1 balls in Hamming graphs
• $PI$-eigenfunctions of the Star graphs
• On existence of perfect bitrades in Hamming graphs
• On degree-$3$ and $(n-4)$-correlation-immune perfect colorings of $n$-cubes