Abstract
We provide several heuristics to improve the efficiency of exhaustively generating Gray codes on length n binary strings. We then apply the heuristics to a restricted class of Gray codes on binary strings known as Beckett-Gray codes. The resulting algoirthm has a speed-up by a factor of 60 over the fastest previously known algorithm when n = 6. It was also used to discover over 9500 new Beckett-Gray codes for n = 7 in the equivalent of three months of computation time. Crown
| Original language | English |
|---|---|
| Pages (from-to) | 571-577 |
| Number of pages | 7 |
| Journal | Electronic Notes in Discrete Mathematics |
| Volume | 29 |
| Issue number | SPEC. ISS. |
| DOIs | |
| Publication status | Published - 15 Aug 2007 |
| Externally published | Yes |
Keywords
- Beckett-Gray codes
- Code generation
- Enumeration
- Gray codes