An upper bound associated with errors in Gray code (Corresp.)

Suppose
0 \leq i,j \leq 2^n - 1
. We prove that, if
i,j
are encoded as binary Gray codewords whose Hamming distance is
m \geq 1
, then
\mid i-j \mid < 2^n - 2^m /3
.