Efficient Generation of the Binary Reflected Gray Code and Its Applications

Communications of the ACM

Volumn 19, Issue 9, 1976, Pages 517-521

  Bitner, James R ^a   Ehrlich, Gideon ^b   Reingold, Edward M ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

combinations; combinatorial computing; compositions; Gray code; subsets

Indexed keywords

COMPUTER PROGRAMMING - SUBROUTINES; MATHEMATICAL TECHNIQUES;

CODES, SYMBOLIC;

EID: 0016994626     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/360336.360343     Document Type: Article

References (12)

1. Boothroyd, J. Algorithm 246, Gray code. Comm. ACM 7, 12 (Dec. 1964), 701.
2. Chase, P.J. Algorithm 382, Combinations of M out of N objects. Comm. ACM 13, 6 (June 1970), 368.
3. Dershowitz, N. A simplified loop free algorithm for generating permutations. BIT 15, 2 (1975), 158-164.
4. Ehrlich, G. Algorithm 466, four combinatorial algorithms. Comm. ACM 16, 11 (Nov. 1973), 690-691.
5. Ehrlich, G. Loopless algorithms for generating permutations, combinations and other combinatorial configurations. J.ACM 20, 3 (July 1973), 500-513.
6. Flores, I. Reflected number systems. IRE Trans. Electron. Comput. 5, 2 (June 1956), 79-82.
7. Gilbert, E.N. Gray codes and paths on the n-cube. Bell Syst. Tech. J. 37, 9 (May 1958), 815-826.
8. Gray, F. Pulse code communications. U.S. Patent 2 632 058, March 17, 1953.
9. Lenstra, J.W., and Rinnooy Kan, A.H.G. A recursive approach to the generation of combinatorial configurations. Rep. BW 50/75, Mathematisch Centrum, Amsterdam, 1975.
10. Liu, C.N., and Tang, D.T. Algorithm 452, Enumerating M out of N objects. Comm. ACM 16, 8 (Aug. 1973), 485.
11. Misra, J. Remark on Algorithm 246. ACM Trans. Math. Software 1, 3 (Sept. 1975), 285.
12. Tang, D.T., and Liu, C.N. Distance 2-cyclic chaining of constant weight codes. IEEE Trans. Comput. 22, 2 (Feb. 1973), 176-180.