arXiv Analytics

Sign in

arXiv:0802.0003 [math.CO]AbstractReferencesReviewsResources

On mobile sets in the binary hypercube

Yuriy Vasil'ev, Sergey Avgustinovich, Denis Krotov

Published 2008-02-01Version 1

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*6^k 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.

Comments: 9p., in Russian (English version will be finished later)
Journal: Diskretn. Anal. Issled. Oper. 15(3) 2008, 11-21 (in Russian)
Categories: math.CO, cs.IT, math.IT
Subjects: 05B99, 94B25
Related articles: Most relevant | Search more
arXiv:1304.3650 [math.CO] (Published 2013-04-12, updated 2015-09-11)
A note on a sumset in $\mathbb{Z}_{2k}$
arXiv:1106.0807 [math.CO] (Published 2011-06-04)
Cardinality of Rauzy classes
arXiv:1309.2191 [math.CO] (Published 2013-09-09)
The Cardinality of Sumsets: Different Summands