Equivalence classes of 5-bit Gray codes

MaRDI QIDQ5442529zbMATH OpenFDO

Authors Clay Culver, David Leach

Publication date 22 February 2008

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Eulerian and Hamiltonian graphs (05C45) Linear codes (general theory) (94B05)

Recommendations

• Generalized Gray codes with prescribed ends
• Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2^n</tex>
• Gray codes for necklaces
• scientific article; zbMATH DE number 2239558
• Linear time construction of a compressed Gray code

Cited in

(2)

• Counting Hamiltonian cycles in bipartite graphs
• Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2^n</tex>

This page was built for publication: Equivalence classes of 5-bit Gray codes

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