A heuristic approach for constructing symmetric Gray codes
From MaRDI portal
Publication:1883151
DOI10.1016/S0096-3003(03)00759-8zbMATH Open1057.94036MaRDI QIDQ1883151FDOQ1883151
Publication date: 1 October 2004
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Recommendations
Cites Work
- The structure of single-track Gray codes
- A survey of the theory of hypercube graphs
- A Survey of Combinatorial Gray Codes
- Gray codes for partial match and range queries
- Efficient generation of the binary reflected gray code and its applications
- A Technique for Generating Specialized Gray Codes
- Some Complete Cycles on the n-Cube
- An upper bound associated with errors in Gray code (Corresp.)
- Single-track Gray codes
Cited In (3)
This page was built for publication: A heuristic approach for constructing symmetric Gray codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1883151)