Gray codes and symmetric chains

Petr Gregor, Sven Jäger, Torsten Mütze +2

We consider the problem of constructing a cyclic listing of all bitstrings of length $2n+1$ with Hamming weights in the interval $[n+1-\ell ,n+\ell ]$, where $1\le \ell \le n+1$, by…