The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A Survey of Combinatorial Gray Codes
Abstract
The term combinatorial Gray code was introduced in 1980 to refer to any method for generating combinatorial objects so that successive objects differ in some prespecified, small way. This notion generalizes the classical binary reflected Gray code scheme for listing n-bit binary numbers so that successive numbers differ in exactly one bit position, as well as work in the 1960s and 1970s on minimal change listings for other combinatorial families, including permutations and combinations. The area of combinatorial Gray codes was popularized by Herbert Wilf in his invited address at the SIAM Conference on Discrete Mathematics in 1988 and his subsequent SIAM monograph [Combinatorial Algorithms: An Update, 1989] in which he posed some open problems and variations on the theme. This resulted in much recent activity in the area, and most of the problems posed by Wilf are now solved. In this paper, we survey the area of combinatorial Gray codes, describe recent results, variations, and trends, and highlight some open problems.
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
Cites
(1979) · Cited by 43,841
Bruijn, D. N. D. (1946) · TU/e Research Portal · Cited by 1,289
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
Fredricksen, H. M. (1982) · SIAM Review · doi:10.1137/1024041 · Cited by 434
Combinatorial Algorithms: For Computers and Calculators
Nijenhuis, A., & Will, H. S. (2014) · Cited by 349
Brightwell, G., & Winkler, P. (1991) · Order · doi:10.1007/bf00383444 · Cited by 276
Efficient generation of the binary reflected gray code and its applications
Bitner, J. R., Ehrlich, G., & Reingold, E. M. (1976) · Communications of the ACM · doi:10.1145/360336.360343 · Cited by 240
Ehrlich, G. (1973) · Journal of the ACM · doi:10.1145/321765.321781 · Cited by 184
Counting linear extensions is #P-complete
Brightwell, G., & Winkler, P. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103441 · Cited by 163
Hard Enumeration Problems in Geometry and Combinatorics
Linial, N. (1986) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0607036 · Cited by 130
Heath, F. G. (1972) · Scientific American · doi:10.1038/scientificamerican0872-76 · Cited by 75
Cited by
Quantum Circuits for General Multiqubit Gates
Möttönen, M., Vartiainen, J. J., Bergholm, V., & Salomaa, M. M. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.130502 · Cited by 390
Enhancing false negative and positive rates for efficient insider threat detection
AlSlaiman, M., Salman, M. I., Saleh, M. M., & Wang, B. (2023) · Computers & Security · doi:10.1016/j.cose.2022.103066 · Cited by 49
Low autocorrelation binary sequences
Packebusch, T., & Mertens, S. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/16/165001 · Cited by 64
Metadata
- Authors
- Savage, C.
- Venue
- SIAM Review
- Published
- 1997-01
- Volume
- 39
- Issue
- 4
- Pages
- 605-629
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2046815858
- Cited by
- 482
- References
- 17
- FWCI
- 3.99
- Type
- journal article
- Language
- en
- Open access
- closed
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: A Survey of Combinatorial Gray Codes. https://app.cochat.ai/papers/10.1137/s0036144595295272
- The paper
- Savage, C. (1997). A Survey of Combinatorial Gray Codes. SIAM Review. https://doi.org/10.1137/s0036144595295272
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.