The extended 1-perfect trades in small hypercubes
arXiv:1512.03421 · doi:10.1016/j.disc.2017.06.016
Abstract
An extended -perfect trade is a pair of two disjoint binary distance- even-weight codes such that the set of words at distance from coincides with the set of words at distance from . Such trade is called primary if any pair of proper subsets of and is not a trade. Using a computer-aided approach, we classify nonequivalent primary extended -perfect trades of length , constant-weight extended -perfect trades of length , and Steiner trades derived from them. In particular, all Steiner trades with parameters are classified.
arXiv comment18pp. v.3: revised; bitrades are called trades in v.3; more references
References in corpus (6)
- To the theory of -ary Steiner and other-type trades
- On the structure of non-full-rank perfect codes
- On the binary codes with parameters of doubly-shortened 1-perfect codes
- On the binary codes with parameters of triply-shortened 1-perfect codes
- Embedding in a perfect code
- On mobile sets in the binary hypercube