A fast algorithm to generate Beckett-Gray codes. Extended Abstract

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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 languageEnglish
Pages (from-to)571-577
Number of pages7
JournalElectronic Notes in Discrete Mathematics
Issue numberSPEC. ISS.
Publication statusPublished - 15 Aug 2007
Externally publishedYes


  • Beckett-Gray codes
  • Code generation
  • Enumeration
  • Gray codes


Dive into the research topics of 'A fast algorithm to generate Beckett-Gray codes. Extended Abstract'. Together they form a unique fingerprint.

Cite this