A simple proof for the existence of exponentially balanced Gray codes (Q2571312)

Summary: A Gray code of length \(n\) is a circular list of all \(2^n\) bitstrings or binary codewords of length \(n\) such that successive codewords differ in only one bit position. The frequencies of the positions where these differences occur are called transition counts. An exponentially balanced Gray codes is derived. The proof is much simpler than an earlier proof presented by \textit{A. J. van Zantan} and \textit{I. N. Suparta} [Disretn. Anal. Issled. Oper., Ser. 1, 11, No. 4, 81--98 (2004; Zbl 1078.94040)].