On Generating the N-ary Reflected Gray Codes

1 August 1984

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-33 (8) , 739-741
https://doi.org/10.1109/tc.1984.5009360

Abstract

The definition of the N-ary reflected Gray code is given. Two recursive algorithms for generating the N-ary reflected Gray codes are presented: one algorithm is coded directly from the definition; another algorithm is derived from the sequencing orders of digits in the N-ary reflected Gray codes. It is shown that these two algorithms are equivalent functionally. Furthermore, it is proven that the N-ary reflected Gray code is cyclic when its radix is even, but not cyclic, in general, when its radix is odd.

Keywords

This publication has 4 references indexed in Scilit:

On m-ary Gray codes
Information Sciences, 1978
Efficient generation of the binary reflected gray code and its applications
Communications of the ACM, 1976
Affine m-ary gray codes
Information and Control, 1963
Reflected Number Systems
IEEE Transactions on Electronic Computers, 1956