Statistical estimates of the<tex>n</tex>-bit Gray codes by restricted random generation of permutations of 1 to<tex>2ⁿ</tex>

DOI10.1109/TIT.1983.1056755MaRDI QIDQ3315436zbMATH OpenFDO

Authors Jerry Silverman, Virgil E. Vickers, J. L. Sampson

Publication date 1983

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

random permutationsstatistical estimatesMonte Carlo processcyclic Gray codesnumber of Hamiltonian circuits on the n-cubenumber of n-bit Gray codes

Mathematics Subject Classification ID

Combinatorial codes (94B25) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Recommendations

• Gray code for permutations with a fixed number of cycles
• Equivalence classes of 5-bit Gray codes
• Note on Gray codes for permutation lists
• scientific article; zbMATH DE number 4087600
• A Survey of Combinatorial Gray Codes

Cited in

(4)

• Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes
• A fast algorithm to generate Beckett-Gray codes
• Counting Hamiltonian cycles in bipartite graphs
• Equivalence classes of 5-bit Gray codes

This page was built for publication: Statistical estimates of the&lt;tex&gt;n&lt;/tex&gt;-bit Gray codes by restricted random generation of permutations of 1 to&lt;tex&gt;2^n&lt;/tex&gt;

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