On independent set of Lee distance Gray codes
Myung M. Bae, B. Bose · 2002
In a Gray code C, the set of k/sup n/ vectors over Z/sub k//sup n/ is arranged in a sequence such that two adjacent vectors are at a Lee distance one. It is assumed that the first and the last vectors in this sequence are also at a distance 1. Two Gray codes, C/sub 1/ and C/sub 2/, over Z/sub k//sup n/ are said to be independent if two words, a and b, are adjacent in C/sub 1/ (or C/sub 2/), then they are not adjacent in C/sub 2/ (or C/sub 1/). If k/spl ges/3, we can have at most n sets of independent Gray codes; for k=2, this number is [n/2].