Gray codes and symmetric chains

Abstrakt

We consider the problem of constructing a cyclic listing of all bitstrings of length 2n+1 with Hamming weights in the interval [n+1-l,n+l], where 1 = 12.

Klíčová slova

• Gray code
• Hamilton cycle
• hypercube
• poset
• symmetric chain