I recherch and i gave The core problem asks to partition the vertices of an $N$-dimensional hypercube ($Q_N$) into $N$ subset sequences $s_0, s_1, \dots, s_{N-1}$ of size $2^N / N$ such that every binary vector $n \in \{0,1\}^N$ has a neighbor at Hamming distance 1 (or distance 0) in every sequence $s_i$.
In graph theory terms, each sequence $s_i$ must form a domanathing set (or 1-dominating code) in $Q_N$.
i know only that about it if...
Joyfull
Last Activity: 3 weeks ago
Joined: 3 weeks ago
Location:
-
I recherch and i gave The core problem asks to partition the vertices of an $N$-dimensional hypercube ($Q_N$) into $N$ subset sequences $s_0, s_1, \dots, s_{N-1}$ of size $2^N / N$ such that every binary vector $n \in \{0,1\}^N$ has a neighbor at Hamming distance 1 (or distance 0) in every sequence $s_i$.
In graph theory terms, each sequence $s_i$ must form a domanathing set (or 1-dominating code) in $Q_N$.
i know only that about it if...Leave a comment:
No activity results to display
Leave a comment: