Given N as the number of bits, how to find N sequences of (2^N/N) numbers each such that: given an arbitrary number n, there is always one number in each sequence that has hamming distance 1 from n.

As a reference hamming distance 1 means that two numbers have only one bit that is different.

For example given N=4, one of the possible solution to the aforementioned problem is:

s0 = [ 0000 0001 1110 1111...