Iterating an α-ary gray code

SIAM Journal on Discrete Mathematics

Volumn 11, Issue 3, 1998, Pages 381-386

  Lichtner, Jonathan ^a  

^a NONE   (Canada)

Author keywords

Gray codes

Indexed keywords

EID: 2242473582     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196308736     Document Type: Article

References (5)

1. L. S. BARASCH, S. LAKSHMIVARAHAN, AND S. K. DHALL, Generalized Gray codes and their properties, in Mathematics for Large Scale Computing, Lecture Notes in Pure and Appl. Math. 120, J.C. Diaz, ed., Marcel Dekker, New York, 1989, pp. 203-216.
2. J. R. BITNER, G. EHRLICH, AND E. M. REINGOLD, Efficient generation of the binary reflected Gray code and its applications, Comm. ACM, 19 (1976), pp. 517-521.
3. J. CULBERSON, Mutation-crossover isomorphisms and the construction of discriminating functions, Evolutionary Comput., 2 (1995), pp. 279-311.
4. B. D. SHARMA AND R. K. KHANNA, On m-ary Gray codes, Inform. Sci., 15 (1978), pp. 31-43.
5. B. D. SHARMA AND R. K. KHANNA, Integer characterization of binary and m-ary Gray codes, J. Combin. Inform. System Sci., 4 (1979), pp. 227-236.