Title :
On independent set of Lee distance Gray codes
Author :
Bae, Myung M. ; Bose, Bella
Author_Institution :
Scalable POWERparallel Syst., IBM Corp., Poughkeepsie, NY, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
In a Gray code C, the set of kn vectors over Zk 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, C1 and C2, over Zkn are said to be independent if two words, a and b, are adjacent in C1 (or C2), then they are not adjacent in C2 (or C 1). If k⩾3, we can have at most n sets of independent Gray codes; for k=2, this number is [n/2]
Keywords :
Gray codes; vectors; Gray codes; Lee distance; adjacent vectors; independent set; Computer aided software engineering; Computer science; Reflective binary codes;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613440
