Abstract
An n-bit cyclic Gray code is a cyclic sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe a construction of an n-bit cyclic Gray code whose graph of transitions is a subgraph of the d-dimensional hypercube and 2^{d -1}<n<2^d.
This allows to compress sequences that follow this code so that only Theta(log log n) bits per n-bit string are needed.