A technique for generating Gray codes
From MaRDI portal
Publication:1152345
DOI10.1016/0378-3758(81)90027-6zbMATH Open0459.94023OpenAlexW2049958805MaRDI QIDQ1152345FDOQ1152345
Authors: J. L. Sampson, Jacques E. Ludman
Publication date: 1981
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(81)90027-6
Recommendations
Cites Work
Cited In (10)
- Gray codes for reflection groups
- A general exhaustive generation algorithm for Gray structures
- Title not available (Why is that?)
- Monotone Gray codes and the middle levels problem
- A Technique for Generating Specialized Gray Codes
- Amortized efficiency of generating planar paths in convex position
- Binary Gray codes with long bit runs
- On a characterization of the standard Gray code by using the edge type on a hypercube
- Trimming and gluing Gray codes
- Title not available (Why is that?)
This page was built for publication: A technique for generating Gray codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152345)