Efficient generation of the binary reflected gray code and its applications
- 1 September 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 19 (9) , 517-521
- https://doi.org/10.1145/360336.360343
Abstract
Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the next element from the current one is constant. Applications to the generation of the combinations of n things taken k at a time, the compositions of integers, and the permutations of a multiset are discussed.Keywords
This publication has 8 references indexed in Scilit:
- Remark on algorithm 246ACM Transactions on Mathematical Software, 1975
- A simplified loop-free algorithm for generating permutationsBIT Numerical Mathematics, 1975
- Algorithm 466: four combinatorial algorithm [G6]Communications of the ACM, 1973
- Algorithm 452: enumerating combinations of m out of n objects [G6]Communications of the ACM, 1973
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial ConfigurationsJournal of the ACM, 1973
- Algorithm 382: combinations of M out of N objects [G6]Communications of the ACM, 1970
- Algorithm 246: GraycodeCommunications of the ACM, 1964
- Gray Codes and Paths on the n-CubeBell System Technical Journal, 1958