The DOI matches its Crossref record.
Efficient generation of the binary reflected gray code and its applications
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A Survey of Combinatorial Gray Codes
Savage, C. (1997) · SIAM Review · doi:10.1137/s0036144595295272 · Cited by 482
Loopless Gray code enumeration and the Tower of Bucharest
Herter, F., & Rote, G. (2018) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.11.017 · Cited by 9
Metadata
- Authors
- Bitner, J. R., Ehrlich, G., & Reingold, E. M.
- Venue
- Communications of the ACM
- Published
- 1976-09
- Volume
- 19
- Issue
- 9
- Pages
- 517-521
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2044338030
- Cited by
- 240
- References
- 0
- FWCI
- 2.77
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient generation of the binary reflected gray code and its applications. https://app.cochat.ai/papers/10.1145/360336.360343
- The paper
- Bitner, J. R., Ehrlich, G., & Reingold, E. M. (1976). Efficient generation of the binary reflected gray code and its applications. Communications of the ACM. https://doi.org/10.1145/360336.360343
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.