The separability of standard cyclic N-ary Gray codes

A sharp lower bound is derived for the cyclic list distance between two codewords, having Hamming distance m, in the standard N-ary Gray code of length n, for 1<=m<=n and for even values of N. The bound generalizes a similar result in the binary case.