Before revision:  This Gray code can be generated in O(log \Oh ^2 n) amortized time per word, while the best generation algorithm hitherto has O \Oh (n) running time per word.
After revision:  This Gray code can be generated in O(log \Oh(\log ^2 n) amortized time per word, while the best generation algorithm hitherto has O \Oh (n) running time per word.