A fast algorithm to generate Beckett-Gray codes

DOI10.1016/J.ENDM.2007.07.091MaRDI QIDQ3503521zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Joe Sawada, Dennis Wong

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2007.07.091

zbMATH Keywords

Beckett-Gray codescode generationenumerationgray codes

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Recommendations

• scientific article; zbMATH DE number 1933234
• scientific article; zbMATH DE number 2040940
• Improved methods for generating quasi-Gray codes
• Linear time construction of a compressed Gray code
• Gray codes for necklaces and Lyndon words of arbitrary base

Cites work

• Generation of Permutations by Transposition
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2^n</tex>

Cited in

(4)

• Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes
• Matchings in hypercubes extend to long cycles
• A note on Beckett-Gray codes and the relationship of Gray codes to data structures
• One sequence to rule them all: \( \mathcal{O}(1)\)-time parallel generation of mixed-radix Gray codes

This page was built for publication: A fast algorithm to generate Beckett-Gray codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503521)