A common use of Gray codes is in reducing quantisation errors in various types of analogue-to-digital conversion systems. As a typical example, a length n Gray code can be used to record the absolute angular positions of a rotating wheel by encoding the codewords on n concentrically arranged tracks. A number of reading heads, n, mounted radially across the trades, suffice to recover the codewords and it is well known that quantisation errors are minimised by using a Gray encoding. When a high resolution is required, the need for a large number of concentric tracks results in encoders with large physical dimensions. This poses a problem in the design of small-scale or high-speed devices. We propose single-trade Gray codes as a way of overcoming this problem. Let W/sub 0/,W/sub 1/...,W/sub p-1/ be the codewords of a Gray code C and write W/sub i/=[w/sub i//sup 0/,w/sub i//sup 1/,...,w/sub i//sup n-1/]/sup T/. We call the sequence w/sub 0//sup j/,w/sub 1//sup j/,...,w/sub p-1//sup j/ component sequence j of C.
[1]
Victor Klee.
THE USE OF CIRCUIT CODES IN ANALOG-TO-DIGITAL CONVERSION,
,
1970
.
[2]
Carla D. Savage.
Gray Code Sequences of Partitions
,
1989,
J. Algorithms.
[3]
Bhu Dev Sharma,et al.
On m-ary Gray codes
,
1978,
Inf. Sci..
[4]
M. C. Er,et al.
On Generating the N-ary Reflected Gray Codes
,
1984,
IEEE Transactions on Computers.
[5]
Tuvi Etzion.
Self-dual sequences
,
1987,
J. Comb. Theory, Ser. A.
[6]
Paul Klingsberg,et al.
A Gray Code for Compositions
,
1982,
J. Algorithms.
[7]
E. Gilbert.
Gray codes and paths on the N-cube
,
1958
.
[8]
Emil M. Petriu,et al.
Automated guided vehicle position recovery
,
1990
.
[9]
Edward M. Reingold,et al.
Efficient generation of the binary reflected gray code and its applications
,
1976,
CACM.
[10]
A. J. van Zanten.
Minimal-change order and separability in linear codes
,
1993,
IEEE Trans. Inf. Theory.
[11]
W. H. Mills.
Some complete cycles on the $n$-cube
,
1963
.