Next Article in Journal
Convergence in Total Variation to a Mixture of Gaussian Laws
Next Article in Special Issue
Decomposition of Dynamical Signals into Jumps, Oscillatory Patterns, and Possible Outliers
Previous Article in Journal
Several Results of Fractional Differential and Integral Equations in Distribution
Previous Article in Special Issue
Theoretical Study of the One Self-Regulating Gene in the Modified Wagner Model
Open AccessFeature PaperArticle

Gray Codes Generation Algorithm and Theoretical Evaluation of Random Walks in N-Cubes

1
Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), UMR 7503, Université de Lorraine, F-54506 Vandoeuvre-lès-Nancy, France
2
FEMTO-ST Institute, UMR 6174, Université Bourgogne Franche-Comté, 19 Av. du Maréchal Juin, F-90000 Belfort, France
*
Author to whom correspondence should be addressed.
Mathematics 2018, 6(6), 98; https://doi.org/10.3390/math6060098
Received: 1 February 2018 / Revised: 24 May 2018 / Accepted: 29 May 2018 / Published: 8 June 2018
In previous works, some of the authors have proposed a canonical form of Gray Codes (GCs) in N-cubes (hypercubes of dimension N). This form allowed them to draw an algorithm that theoretically provides exactly all the GCs for a given dimension N. In another work, we first have shown that any of these GC can be used to build the transition function of a Pseudorandom Number Generator (PRNG). Also, we have found a theoretical quadratic upper bound of the mixing time, i.e., the number of iterations that are required to provide a PRNG whose output is uniform. This article, extends these two previous works both practically and theoretically. On the one hand, another algorithm for generating GCs is proposed that provides an efficient generation of subsets of the entire set of GCs related to a given dimension N. This offers a large choice of GC to be used in the construction of Choatic Iterations based PRNGs (CI-PRNGs), leading to a large class of possible PRNGs. On the other hand, the mixing time has been theoretically shown to be in Nlog(N), which was anticipated in the previous article, but not proven. View Full-Text
Keywords: Gray Codes; Hamiltonian cycles; N-cube; mixing time; PRNG Gray Codes; Hamiltonian cycles; N-cube; mixing time; PRNG
Show Figures

Figure 1

MDPI and ACS Style

Contassot-Vivier, S.; Couchot, J.-F.; Héam, P.-C. Gray Codes Generation Algorithm and Theoretical Evaluation of Random Walks in N-Cubes. Mathematics 2018, 6, 98.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop