On mobile sets in the binary hypercube
| dc.creator | Vasil'ev, Yuriy | |
| dc.creator | Avgustinovich, Sergey | |
| dc.creator | Krotov, Denis | |
| dc.date | 2008-02-01 | |
| dc.date.accessioned | 2026-07-07T09:54:39Z | |
| dc.date.available | 2026-07-07T09:54:39Z | |
| dc.description | 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. | |
| dc.description | 9p., in Russian (English version will be finished later) | |
| dc.identifier | https://arxiv.org/abs/0802.0003 | |
| dc.identifier | http://arxiv.org/abs/0802.0003 | |
| dc.identifier | Diskretn. Anal. Issled. Oper. 15(3) 2008, 11-21 (in Russian) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166392 | |
| dc.subject | Combinatorics | |
| dc.subject | Information Theory | |
| dc.subject | 05B99; 94B25 | |
| dc.title | On mobile sets in the binary hypercube | |
| dc.type | text |