We consider locally balanced Gray codes.We say that a Gray code is locally balanced if every short subword in its transition sequence contains all letters of the alphabet |1, 2,..., n~. The minimal length of these subwords is the window width of the code. We show that for each n 3 there exists a Gray code with window width at most n + 3+log n+.
展开▼
机译：我们考虑局部平衡的格雷码。我们说，如果过渡序列中的每个短子词都包含字母| 1、2，...，n〜的所有字母，则格雷码是局部平衡的。这些子字的最小长度是代码的窗口宽度。我们表明，对于每个n 3，存在一个格雷码，其窗口宽度最大为n + 3 + log n +。
展开▼
