Canonical Form of Gray Codes in N-cubes
Abstract
In previous works, the idea of walking into a $\mathsf {N}$-cube where a balanced Hamiltonian cycle have been removed has been proposed as the basis of a chaotic PRNG whose chaotic behavior has been proven. However, the construction and selection of the most suited balanced Hamiltonian cycles implies practical and theoretical issues. We propose in this paper a canonical form for representing isomorphic Gray codes. It provides a drastic complexity reduction of the exploration of all the Hamiltonian cycles and we discuss some criteria for the selection of the most suited cycles for use in our chaotic PRNG.
Domains
Computer Science [cs]
Origin : Files produced by the author(s)
Loading...
