Efficient computation of middle levels Gray codes

Torsten Mütze, Jerri Nummenpalo

For any integer $n\ge 1$ a middle levels Gray code is a cyclic listing of all bitstrings of length $2n+1$ that have either $n$ or $n+1$ entries equal to 1 such that any two consec…